Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times
We consider the problem of weighted throughput in the single machine preemptive scheduling with continuous controllable processing times. A set of tasks can be scheduled on a single machine. Each task j is associated with a nonnegative weight w j , a release date, a due date, and an interval of poss...
Gespeichert in:
| Veröffentlicht in: | Acta informatica 2023-06, Vol.60 (2), p.101-122 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 122 |
|---|---|
| container_issue | 2 |
| container_start_page | 101 |
| container_title | Acta informatica |
| container_volume | 60 |
| creator | Levin, Asaf Shusterman, Tal |
| description | We consider the problem of weighted throughput in the single machine preemptive scheduling with continuous controllable processing times. A set of tasks can be scheduled on a single machine. Each task
j
is associated with a nonnegative weight
w
j
, a release date, a due date, and an interval of possible processing times. A task
j
can either be scheduled with a total processing time
p
j
which is in the given interval, or rejected (not participating in the schedule). The reward for processing
j
for
p
j
time units is
w
j
p
j
, and we are interested in constructing a feasible preemptive schedule such that the sum of rewards is maximized. We present a dynamic programming algorithm that solves the problem in pseudo-polynomial time and use it to obtain an FPTAS. Afterward, as our main contribution we propose an interesting efficient frontier approach for improved complexity bounds. |
| doi_str_mv | 10.1007/s00236-022-00430-4 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2812267281</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2812267281</sourcerecordid><originalsourceid>FETCH-LOGICAL-c270t-25ce6ccf9ce650473e3add772db9245bf9b716501083cf75c090c723f66d7ad23</originalsourceid><addsrcrecordid>eNp9UE1LxDAQDaJgXf0DngKeq5OkbbZHWfyCBS-Kx9Cm0zZrv0xSxX9vdit48_RmmPfezDxCLhlcMwB54wC4yGLgPAZIBMTJEYlYIkKb8vSYRADA4jQHcUrOnNuFVnLBIvL-hqZpPVbUt3acm3aaPTUDLagzQ9Mh7QvdmgHpZBH7yZtPpE63WM1dmNMv41uqx8GbYR5ndyjt2HVF2e0lo0a396He9OjOyUlddA4vfnFFXu_vXjaP8fb54Wlzu401l-BjnmrMtK7zACkkUqAoqkpKXpU5T9KyzkvJwoTBWuhaphpy0OGbOssqWVRcrMjV4hsO-JjRebUbZzuElYqvGeeZDBBYfGFpOzpnsVaTNX1hvxUDtQ9VLaGqEKo6hKqSIBKLyAXy0KD9s_5H9QNOXHwo</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2812267281</pqid></control><display><type>article</type><title>Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times</title><source>SpringerLink Journals - AutoHoldings</source><creator>Levin, Asaf ; Shusterman, Tal</creator><creatorcontrib>Levin, Asaf ; Shusterman, Tal</creatorcontrib><description>We consider the problem of weighted throughput in the single machine preemptive scheduling with continuous controllable processing times. A set of tasks can be scheduled on a single machine. Each task
j
is associated with a nonnegative weight
w
j
, a release date, a due date, and an interval of possible processing times. A task
j
can either be scheduled with a total processing time
p
j
which is in the given interval, or rejected (not participating in the schedule). The reward for processing
j
for
p
j
time units is
w
j
p
j
, and we are interested in constructing a feasible preemptive schedule such that the sum of rewards is maximized. We present a dynamic programming algorithm that solves the problem in pseudo-polynomial time and use it to obtain an FPTAS. Afterward, as our main contribution we propose an interesting efficient frontier approach for improved complexity bounds.</description><identifier>ISSN: 0001-5903</identifier><identifier>EISSN: 1432-0525</identifier><identifier>DOI: 10.1007/s00236-022-00430-4</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithms ; Computer Science ; Computer Systems Organization and Communication Networks ; Controllability ; Data Structures and Information Theory ; Dynamic programming ; Information Systems and Communication Service ; Logics and Meanings of Programs ; Original Article ; Polynomials ; Preempting ; Release dates ; Schedules ; Scheduling ; Software Engineering/Programming and Operating Systems ; Task scheduling ; Theory of Computation</subject><ispartof>Acta informatica, 2023-06, Vol.60 (2), p.101-122</ispartof><rights>The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022</rights><rights>The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c270t-25ce6ccf9ce650473e3add772db9245bf9b716501083cf75c090c723f66d7ad23</cites><orcidid>0000-0001-7935-6218</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00236-022-00430-4$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00236-022-00430-4$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Levin, Asaf</creatorcontrib><creatorcontrib>Shusterman, Tal</creatorcontrib><title>Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times</title><title>Acta informatica</title><addtitle>Acta Informatica</addtitle><description>We consider the problem of weighted throughput in the single machine preemptive scheduling with continuous controllable processing times. A set of tasks can be scheduled on a single machine. Each task
j
is associated with a nonnegative weight
w
j
, a release date, a due date, and an interval of possible processing times. A task
j
can either be scheduled with a total processing time
p
j
which is in the given interval, or rejected (not participating in the schedule). The reward for processing
j
for
p
j
time units is
w
j
p
j
, and we are interested in constructing a feasible preemptive schedule such that the sum of rewards is maximized. We present a dynamic programming algorithm that solves the problem in pseudo-polynomial time and use it to obtain an FPTAS. Afterward, as our main contribution we propose an interesting efficient frontier approach for improved complexity bounds.</description><subject>Algorithms</subject><subject>Computer Science</subject><subject>Computer Systems Organization and Communication Networks</subject><subject>Controllability</subject><subject>Data Structures and Information Theory</subject><subject>Dynamic programming</subject><subject>Information Systems and Communication Service</subject><subject>Logics and Meanings of Programs</subject><subject>Original Article</subject><subject>Polynomials</subject><subject>Preempting</subject><subject>Release dates</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Software Engineering/Programming and Operating Systems</subject><subject>Task scheduling</subject><subject>Theory of Computation</subject><issn>0001-5903</issn><issn>1432-0525</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp9UE1LxDAQDaJgXf0DngKeq5OkbbZHWfyCBS-Kx9Cm0zZrv0xSxX9vdit48_RmmPfezDxCLhlcMwB54wC4yGLgPAZIBMTJEYlYIkKb8vSYRADA4jQHcUrOnNuFVnLBIvL-hqZpPVbUt3acm3aaPTUDLagzQ9Mh7QvdmgHpZBH7yZtPpE63WM1dmNMv41uqx8GbYR5ndyjt2HVF2e0lo0a396He9OjOyUlddA4vfnFFXu_vXjaP8fb54Wlzu401l-BjnmrMtK7zACkkUqAoqkpKXpU5T9KyzkvJwoTBWuhaphpy0OGbOssqWVRcrMjV4hsO-JjRebUbZzuElYqvGeeZDBBYfGFpOzpnsVaTNX1hvxUDtQ9VLaGqEKo6hKqSIBKLyAXy0KD9s_5H9QNOXHwo</recordid><startdate>20230601</startdate><enddate>20230601</enddate><creator>Levin, Asaf</creator><creator>Shusterman, Tal</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0001-7935-6218</orcidid></search><sort><creationdate>20230601</creationdate><title>Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times</title><author>Levin, Asaf ; Shusterman, Tal</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c270t-25ce6ccf9ce650473e3add772db9245bf9b716501083cf75c090c723f66d7ad23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Computer Science</topic><topic>Computer Systems Organization and Communication Networks</topic><topic>Controllability</topic><topic>Data Structures and Information Theory</topic><topic>Dynamic programming</topic><topic>Information Systems and Communication Service</topic><topic>Logics and Meanings of Programs</topic><topic>Original Article</topic><topic>Polynomials</topic><topic>Preempting</topic><topic>Release dates</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Software Engineering/Programming and Operating Systems</topic><topic>Task scheduling</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Levin, Asaf</creatorcontrib><creatorcontrib>Shusterman, Tal</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Complete</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central Basic</collection><jtitle>Acta informatica</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Levin, Asaf</au><au>Shusterman, Tal</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times</atitle><jtitle>Acta informatica</jtitle><stitle>Acta Informatica</stitle><date>2023-06-01</date><risdate>2023</risdate><volume>60</volume><issue>2</issue><spage>101</spage><epage>122</epage><pages>101-122</pages><issn>0001-5903</issn><eissn>1432-0525</eissn><abstract>We consider the problem of weighted throughput in the single machine preemptive scheduling with continuous controllable processing times. A set of tasks can be scheduled on a single machine. Each task
j
is associated with a nonnegative weight
w
j
, a release date, a due date, and an interval of possible processing times. A task
j
can either be scheduled with a total processing time
p
j
which is in the given interval, or rejected (not participating in the schedule). The reward for processing
j
for
p
j
time units is
w
j
p
j
, and we are interested in constructing a feasible preemptive schedule such that the sum of rewards is maximized. We present a dynamic programming algorithm that solves the problem in pseudo-polynomial time and use it to obtain an FPTAS. Afterward, as our main contribution we propose an interesting efficient frontier approach for improved complexity bounds.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s00236-022-00430-4</doi><tpages>22</tpages><orcidid>https://orcid.org/0000-0001-7935-6218</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0001-5903 |
| ispartof | Acta informatica, 2023-06, Vol.60 (2), p.101-122 |
| issn | 0001-5903 1432-0525 |
| language | eng |
| recordid | cdi_proquest_journals_2812267281 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Algorithms Computer Science Computer Systems Organization and Communication Networks Controllability Data Structures and Information Theory Dynamic programming Information Systems and Communication Service Logics and Meanings of Programs Original Article Polynomials Preempting Release dates Schedules Scheduling Software Engineering/Programming and Operating Systems Task scheduling Theory of Computation |
| title | Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T20%3A37%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Weighted%20throughput%20in%20a%20single%20machine%20preemptive%20scheduling%20with%20continuous%20controllable%20processing%20times&rft.jtitle=Acta%20informatica&rft.au=Levin,%20Asaf&rft.date=2023-06-01&rft.volume=60&rft.issue=2&rft.spage=101&rft.epage=122&rft.pages=101-122&rft.issn=0001-5903&rft.eissn=1432-0525&rft_id=info:doi/10.1007/s00236-022-00430-4&rft_dat=%3Cproquest_cross%3E2812267281%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2812267281&rft_id=info:pmid/&rfr_iscdi=true |