Online scheduling with preemption or non-completion penalties
We consider online preemptive scheduling problems where jobs have deadlines and the objective is to maximize the total weight of jobs completed before their deadlines. In the first problem, preemptions are not free but incur a penalty. In the second problem, a job has to be accepted or rejected imme...
Gespeichert in:
| Veröffentlicht in: | Journal of scheduling 2014-04, Vol.17 (2), p.173-183 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 183 |
|---|---|
| container_issue | 2 |
| container_start_page | 173 |
| container_title | Journal of scheduling |
| container_volume | 17 |
| creator | Fung, Stanley P. Y. |
| description | We consider online preemptive scheduling problems where jobs have deadlines and the objective is to maximize the total weight of jobs completed before their deadlines. In the first problem, preemptions are not free but incur a penalty. In the second problem, a job has to be accepted or rejected immediately upon arrival, and may need to be immediately allocated a fixed scheduling interval as well; if these accepted jobs are not eventually completed, the job is lost, and a penalty is incurred. We give an algorithm with the optimal competitive ratio for the first problem, and new and improved algorithms for the second problem, under different models of preemptions and job weights. |
| doi_str_mv | 10.1007/s10951-013-0321-5 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1520932734</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1520932734</sourcerecordid><originalsourceid>FETCH-LOGICAL-c380t-4dbec7f98ebbd4dd10d2b177937ef53741a6e3b57a885a94218019b4f27138203</originalsourceid><addsrcrecordid>eNp1kEtLxEAQhIMouK7-AG8BL15Gu-eRyRw8yOILFvai5yGPzm6WZBJnEsR_b9Z4EMFTF8VXRVNRdIlwgwD6NiAYhQxQMBAcmTqKFpNlGEqujr-1ZAmK5DQ6C2EPAKnmuIjuNq6pHcWh2FE5TnIbf9TDLu49UdsPdefizseuc6zo2r6hb6cnlzVDTeE8OqmyJtDFz11Gb48Pr6tntt48vazu16wQKQxMljkVujIp5XkpyxKh5DlqbYSmSgktMUtI5EpnaaoyIzmmgCaXFdcoUg5iGV3Pvb3v3kcKg23rUFDTZI66MVhUHIzgWsgJvfqD7rvRT_8eKAChtDLJROFMFb4LwVNle1-3mf-0CPYwqJ0HtdOg9jCoVVOGz5kwsW5L_lfzv6EvG913GA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1500357596</pqid></control><display><type>article</type><title>Online scheduling with preemption or non-completion penalties</title><source>SpringerLink Journals</source><creator>Fung, Stanley P. Y.</creator><creatorcontrib>Fung, Stanley P. Y.</creatorcontrib><description>We consider online preemptive scheduling problems where jobs have deadlines and the objective is to maximize the total weight of jobs completed before their deadlines. In the first problem, preemptions are not free but incur a penalty. In the second problem, a job has to be accepted or rejected immediately upon arrival, and may need to be immediately allocated a fixed scheduling interval as well; if these accepted jobs are not eventually completed, the job is lost, and a penalty is incurred. We give an algorithm with the optimal competitive ratio for the first problem, and new and improved algorithms for the second problem, under different models of preemptions and job weights.</description><identifier>ISSN: 1094-6136</identifier><identifier>EISSN: 1099-1425</identifier><identifier>DOI: 10.1007/s10951-013-0321-5</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Algorithms ; Arrivals ; Artificial Intelligence ; Business and Management ; Calculus of Variations and Optimal Control; Optimization ; Competition ; Deadlines ; Decision making models ; Evictions ; Fines & penalties ; Intervals ; On-line systems ; Online ; Operations Research/Decision Theory ; Optimization ; Preempting ; Schedules ; Scheduling ; Studies ; Supply Chain Management</subject><ispartof>Journal of scheduling, 2014-04, Vol.17 (2), p.173-183</ispartof><rights>Springer Science+Business Media New York 2013</rights><rights>Springer Science+Business Media New York 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c380t-4dbec7f98ebbd4dd10d2b177937ef53741a6e3b57a885a94218019b4f27138203</citedby><cites>FETCH-LOGICAL-c380t-4dbec7f98ebbd4dd10d2b177937ef53741a6e3b57a885a94218019b4f27138203</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10951-013-0321-5$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10951-013-0321-5$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Fung, Stanley P. Y.</creatorcontrib><title>Online scheduling with preemption or non-completion penalties</title><title>Journal of scheduling</title><addtitle>J Sched</addtitle><description>We consider online preemptive scheduling problems where jobs have deadlines and the objective is to maximize the total weight of jobs completed before their deadlines. In the first problem, preemptions are not free but incur a penalty. In the second problem, a job has to be accepted or rejected immediately upon arrival, and may need to be immediately allocated a fixed scheduling interval as well; if these accepted jobs are not eventually completed, the job is lost, and a penalty is incurred. We give an algorithm with the optimal competitive ratio for the first problem, and new and improved algorithms for the second problem, under different models of preemptions and job weights.</description><subject>Algorithms</subject><subject>Arrivals</subject><subject>Artificial Intelligence</subject><subject>Business and Management</subject><subject>Calculus of Variations and Optimal Control; Optimization</subject><subject>Competition</subject><subject>Deadlines</subject><subject>Decision making models</subject><subject>Evictions</subject><subject>Fines & penalties</subject><subject>Intervals</subject><subject>On-line systems</subject><subject>Online</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Preempting</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Studies</subject><subject>Supply Chain Management</subject><issn>1094-6136</issn><issn>1099-1425</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp1kEtLxEAQhIMouK7-AG8BL15Gu-eRyRw8yOILFvai5yGPzm6WZBJnEsR_b9Z4EMFTF8VXRVNRdIlwgwD6NiAYhQxQMBAcmTqKFpNlGEqujr-1ZAmK5DQ6C2EPAKnmuIjuNq6pHcWh2FE5TnIbf9TDLu49UdsPdefizseuc6zo2r6hb6cnlzVDTeE8OqmyJtDFz11Gb48Pr6tntt48vazu16wQKQxMljkVujIp5XkpyxKh5DlqbYSmSgktMUtI5EpnaaoyIzmmgCaXFdcoUg5iGV3Pvb3v3kcKg23rUFDTZI66MVhUHIzgWsgJvfqD7rvRT_8eKAChtDLJROFMFb4LwVNle1-3mf-0CPYwqJ0HtdOg9jCoVVOGz5kwsW5L_lfzv6EvG913GA</recordid><startdate>20140401</startdate><enddate>20140401</enddate><creator>Fung, Stanley P. Y.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88C</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</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>FR3</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L.0</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M0T</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope><scope>7SC</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140401</creationdate><title>Online scheduling with preemption or non-completion penalties</title><author>Fung, Stanley P. Y.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c380t-4dbec7f98ebbd4dd10d2b177937ef53741a6e3b57a885a94218019b4f27138203</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Arrivals</topic><topic>Artificial Intelligence</topic><topic>Business and Management</topic><topic>Calculus of Variations and Optimal Control; Optimization</topic><topic>Competition</topic><topic>Deadlines</topic><topic>Decision making models</topic><topic>Evictions</topic><topic>Fines & penalties</topic><topic>Intervals</topic><topic>On-line systems</topic><topic>Online</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Preempting</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Studies</topic><topic>Supply Chain Management</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fung, Stanley P. Y.</creatorcontrib><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Healthcare Administration Database (Alumni)</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>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</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>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</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>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Healthcare Administration 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>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><collection>Computer and Information Systems Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of scheduling</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fung, Stanley P. Y.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Online scheduling with preemption or non-completion penalties</atitle><jtitle>Journal of scheduling</jtitle><stitle>J Sched</stitle><date>2014-04-01</date><risdate>2014</risdate><volume>17</volume><issue>2</issue><spage>173</spage><epage>183</epage><pages>173-183</pages><issn>1094-6136</issn><eissn>1099-1425</eissn><abstract>We consider online preemptive scheduling problems where jobs have deadlines and the objective is to maximize the total weight of jobs completed before their deadlines. In the first problem, preemptions are not free but incur a penalty. In the second problem, a job has to be accepted or rejected immediately upon arrival, and may need to be immediately allocated a fixed scheduling interval as well; if these accepted jobs are not eventually completed, the job is lost, and a penalty is incurred. We give an algorithm with the optimal competitive ratio for the first problem, and new and improved algorithms for the second problem, under different models of preemptions and job weights.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s10951-013-0321-5</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1094-6136 |
| ispartof | Journal of scheduling, 2014-04, Vol.17 (2), p.173-183 |
| issn | 1094-6136 1099-1425 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1520932734 |
| source | SpringerLink Journals |
| subjects | Algorithms Arrivals Artificial Intelligence Business and Management Calculus of Variations and Optimal Control Optimization Competition Deadlines Decision making models Evictions Fines & penalties Intervals On-line systems Online Operations Research/Decision Theory Optimization Preempting Schedules Scheduling Studies Supply Chain Management |
| title | Online scheduling with preemption or non-completion penalties |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T13%3A38%3A05IST&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=Online%20scheduling%20with%20preemption%20or%20non-completion%20penalties&rft.jtitle=Journal%20of%20scheduling&rft.au=Fung,%20Stanley%20P.%20Y.&rft.date=2014-04-01&rft.volume=17&rft.issue=2&rft.spage=173&rft.epage=183&rft.pages=173-183&rft.issn=1094-6136&rft.eissn=1099-1425&rft_id=info:doi/10.1007/s10951-013-0321-5&rft_dat=%3Cproquest_cross%3E1520932734%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=1500357596&rft_id=info:pmid/&rfr_iscdi=true |