{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:09:13Z","timestamp":1774368553118,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0167-6377(02)00220-1","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T12:54:29Z","timestamp":1045054469000},"page":"129-136","source":"Crossref","is-referenced-by-count":17,"title":["How useful are preemptive schedules?"],"prefix":"10.1016","volume":"31","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia","family":"Heitmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Hurink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00220-1_BIB1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0167-6377(01)00068-2","article-title":"On preemption redundancy in scheduling unit processing time jobs on two parallel machines","volume":"28","author":"Baptiste","year":"2001","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00220-1_BIB2","unstructured":"P. Baptiste, V. Timkovsky, Thirteen notes on equal-execution-time scheduling, IBM Research Report, 2002."},{"key":"10.1016\/S0167-6377(02)00220-1_BIB3","series-title":"Scheduling Algorithms","author":"Brucker","year":"2001"},{"key":"10.1016\/S0167-6377(02)00220-1_BIB4","doi-asserted-by":"crossref","unstructured":"P. Brucker, J. Hurink, S. Knust, A polynomial algorithm for P|pj=1, rj, outtree|\u2211 Cj, Osnabr\u00fccker Schriften zur Mathematik, Reihe P, No. 227, Math. Methods OR 56, 2001, 2002, to appear.","DOI":"10.1007\/s001860200228"},{"key":"10.1016\/S0167-6377(02)00220-1_BIB5","unstructured":"P. Brucker, S.A. Kravchenko, Preemption can make parallel machine scheduling problems hard, Osnabr\u00fccker Schriften zur Mathematik, Reihe P, No. 211, 1999."},{"key":"10.1016\/S0167-6377(02)00220-1_BIB6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0890-5401(91)90009-Q","article-title":"Scheduling chain-structured tasks to minimize makespan and mean flow time","volume":"92","author":"Du","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/S0167-6377(02)00220-1_BIB7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(02)00220-1_BIB8","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(80)90111-3","article-title":"Complexity results for scheduling chains on a single machine","volume":"4","author":"Lenstra","year":"1980","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00220-1_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Scheduling with deadlines and loss functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Management Sci."},{"key":"10.1016\/S0167-6377(02)00220-1_BIB10","doi-asserted-by":"crossref","unstructured":"R.A. Sitters, Two NP-hardness results for preemptive minsum scheduling of unrelated parallel machines, Proceedings of the Eighth International IPCO Conference, Lecture Notes in Computer Science, Vol. 2081, Springer, Berlin, 2001, pp. 396\u2013405.","DOI":"10.1007\/3-540-45535-3_31"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702002201?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702002201?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T08:04:07Z","timestamp":1584000247000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702002201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0167637702002201"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00220-1","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}