Preemptive scheduling of equal-length jobs to maximize weighted throughput
We study the problem of computing a preemptive schedule of equal-length jobs with given release times, deadlines and weights. Our goal is to maximize the weighted throughput. In Graham's notation this problem is described as (1|r j;p j=p; pmtn|∑ w jU j) . We provide an O( n 4)-time algorithm, i...
Gespeichert in:
| Veröffentlicht in: | Operations research letters 2004, Vol.32 (3), p.258-264 |
|---|---|
| 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 | 264 |
|---|---|
| container_issue | 3 |
| container_start_page | 258 |
| container_title | Operations research letters |
| container_volume | 32 |
| creator | Baptiste, Philippe Chrobak, Marek Dürr, Christoph Jawor, Wojciech Vakhania, Nodari |
| description | We study the problem of computing a preemptive schedule of equal-length jobs with given release times, deadlines and weights. Our goal is to maximize the
weighted throughput. In Graham's notation this problem is described as
(1|r
j;p
j=p;
pmtn|∑
w
jU
j)
. We provide an O(
n
4)-time algorithm, improving the previous bound of O(
n
10). |
| doi_str_mv | 10.1016/j.orl.2003.09.004 |
| format | Article |
| fullrecord | <record><control><sourceid>elsevier_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00012905v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0167637703001238</els_id><sourcerecordid>S0167637703001238</sourcerecordid><originalsourceid>FETCH-LOGICAL-c372t-1279499bdc872f2f26fcd64aaaa59e82f00a4bf75138d15eb0dc8f63e01fc4d03</originalsourceid><addsrcrecordid>eNp9kMtOwzAQRS0EEqXwAeyyZZEwzsuJWFUIKKgSLGBtOfY4cZTWxU7K4-txVcSSmcVIo3tGcy8hlxQSCrS87hPrhiQFyBKoE4D8iMxoxdKY5WV1TGZBw-IyY-yUnHnfAwCraDUjTy8Ocb0dzQ4jLztU02A2bWR1hO-TGOIBN-3YRb1tfDTaaC0-zdp8Y_SBpu1GVNHYOTu13XYaz8mJFoPHi985J2_3d6-3y3j1_PB4u1jFMmPpGNOU1XldN0qG93ToUktV5iJUUWOVagCRN5oVNKsULbCBoNRlhkC1zBVkc3J1uNuJgW-dWQv3xa0wfLlY8f0umKNpDcWOBi09aKWz3jvUfwAFvg-O9zwEx_fBcagDmgfm5sBgMLEz6LiXBjcSlXEoR66s-Yf-ARmpdwE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Preemptive scheduling of equal-length jobs to maximize weighted throughput</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Baptiste, Philippe ; Chrobak, Marek ; Dürr, Christoph ; Jawor, Wojciech ; Vakhania, Nodari</creator><creatorcontrib>Baptiste, Philippe ; Chrobak, Marek ; Dürr, Christoph ; Jawor, Wojciech ; Vakhania, Nodari</creatorcontrib><description>We study the problem of computing a preemptive schedule of equal-length jobs with given release times, deadlines and weights. Our goal is to maximize the
weighted throughput. In Graham's notation this problem is described as
(1|r
j;p
j=p;
pmtn|∑
w
jU
j)
. We provide an O(
n
4)-time algorithm, improving the previous bound of O(
n
10).</description><identifier>ISSN: 0167-6377</identifier><identifier>EISSN: 1872-7468</identifier><identifier>DOI: 10.1016/j.orl.2003.09.004</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Computer Science ; Data Structures and Algorithms ; Single machine preemptive scheduling ; Weighted throughput</subject><ispartof>Operations research letters, 2004, Vol.32 (3), p.258-264</ispartof><rights>2003 Elsevier B.V.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c372t-1279499bdc872f2f26fcd64aaaa59e82f00a4bf75138d15eb0dc8f63e01fc4d03</citedby><cites>FETCH-LOGICAL-c372t-1279499bdc872f2f26fcd64aaaa59e82f00a4bf75138d15eb0dc8f63e01fc4d03</cites><orcidid>0000-0001-8103-5333</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.orl.2003.09.004$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>230,314,780,784,885,3549,4023,27922,27923,27924,45994</link.rule.ids><backlink>$$Uhttps://hal.science/hal-00012905$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Baptiste, Philippe</creatorcontrib><creatorcontrib>Chrobak, Marek</creatorcontrib><creatorcontrib>Dürr, Christoph</creatorcontrib><creatorcontrib>Jawor, Wojciech</creatorcontrib><creatorcontrib>Vakhania, Nodari</creatorcontrib><title>Preemptive scheduling of equal-length jobs to maximize weighted throughput</title><title>Operations research letters</title><description>We study the problem of computing a preemptive schedule of equal-length jobs with given release times, deadlines and weights. Our goal is to maximize the
weighted throughput. In Graham's notation this problem is described as
(1|r
j;p
j=p;
pmtn|∑
w
jU
j)
. We provide an O(
n
4)-time algorithm, improving the previous bound of O(
n
10).</description><subject>Computer Science</subject><subject>Data Structures and Algorithms</subject><subject>Single machine preemptive scheduling</subject><subject>Weighted throughput</subject><issn>0167-6377</issn><issn>1872-7468</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><recordid>eNp9kMtOwzAQRS0EEqXwAeyyZZEwzsuJWFUIKKgSLGBtOfY4cZTWxU7K4-txVcSSmcVIo3tGcy8hlxQSCrS87hPrhiQFyBKoE4D8iMxoxdKY5WV1TGZBw-IyY-yUnHnfAwCraDUjTy8Ocb0dzQ4jLztU02A2bWR1hO-TGOIBN-3YRb1tfDTaaC0-zdp8Y_SBpu1GVNHYOTu13XYaz8mJFoPHi985J2_3d6-3y3j1_PB4u1jFMmPpGNOU1XldN0qG93ToUktV5iJUUWOVagCRN5oVNKsULbCBoNRlhkC1zBVkc3J1uNuJgW-dWQv3xa0wfLlY8f0umKNpDcWOBi09aKWz3jvUfwAFvg-O9zwEx_fBcagDmgfm5sBgMLEz6LiXBjcSlXEoR66s-Yf-ARmpdwE</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Baptiste, Philippe</creator><creator>Chrobak, Marek</creator><creator>Dürr, Christoph</creator><creator>Jawor, Wojciech</creator><creator>Vakhania, Nodari</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0001-8103-5333</orcidid></search><sort><creationdate>2004</creationdate><title>Preemptive scheduling of equal-length jobs to maximize weighted throughput</title><author>Baptiste, Philippe ; Chrobak, Marek ; Dürr, Christoph ; Jawor, Wojciech ; Vakhania, Nodari</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c372t-1279499bdc872f2f26fcd64aaaa59e82f00a4bf75138d15eb0dc8f63e01fc4d03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Computer Science</topic><topic>Data Structures and Algorithms</topic><topic>Single machine preemptive scheduling</topic><topic>Weighted throughput</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Baptiste, Philippe</creatorcontrib><creatorcontrib>Chrobak, Marek</creatorcontrib><creatorcontrib>Dürr, Christoph</creatorcontrib><creatorcontrib>Jawor, Wojciech</creatorcontrib><creatorcontrib>Vakhania, Nodari</creatorcontrib><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Operations research letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Baptiste, Philippe</au><au>Chrobak, Marek</au><au>Dürr, Christoph</au><au>Jawor, Wojciech</au><au>Vakhania, Nodari</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Preemptive scheduling of equal-length jobs to maximize weighted throughput</atitle><jtitle>Operations research letters</jtitle><date>2004</date><risdate>2004</risdate><volume>32</volume><issue>3</issue><spage>258</spage><epage>264</epage><pages>258-264</pages><issn>0167-6377</issn><eissn>1872-7468</eissn><abstract>We study the problem of computing a preemptive schedule of equal-length jobs with given release times, deadlines and weights. Our goal is to maximize the
weighted throughput. In Graham's notation this problem is described as
(1|r
j;p
j=p;
pmtn|∑
w
jU
j)
. We provide an O(
n
4)-time algorithm, improving the previous bound of O(
n
10).</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.orl.2003.09.004</doi><tpages>7</tpages><orcidid>https://orcid.org/0000-0001-8103-5333</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0167-6377 |
| ispartof | Operations research letters, 2004, Vol.32 (3), p.258-264 |
| issn | 0167-6377 1872-7468 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_00012905v1 |
| source | ScienceDirect Journals (5 years ago - present) |
| subjects | Computer Science Data Structures and Algorithms Single machine preemptive scheduling Weighted throughput |
| title | Preemptive scheduling of equal-length jobs to maximize weighted throughput |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T09%3A17%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Preemptive%20scheduling%20of%20equal-length%20jobs%20to%20maximize%20weighted%20throughput&rft.jtitle=Operations%20research%20letters&rft.au=Baptiste,%20Philippe&rft.date=2004&rft.volume=32&rft.issue=3&rft.spage=258&rft.epage=264&rft.pages=258-264&rft.issn=0167-6377&rft.eissn=1872-7468&rft_id=info:doi/10.1016/j.orl.2003.09.004&rft_dat=%3Celsevier_hal_p%3ES0167637703001238%3C/elsevier_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_els_id=S0167637703001238&rfr_iscdi=true |