{"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":1774368553123,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":[[2001,6]]},"DOI":"10.1016\/s0167-6377(01)00068-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:59:48Z","timestamp":1027609188000},"page":"205-212","source":"Crossref","is-referenced-by-count":14,"title":["On preemption redundancy in scheduling unit processing time jobs on two parallel machines"],"prefix":"10.1016","volume":"28","author":[{"given":"Philippe","family":"Baptiste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vadim G.","family":"Timkovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00068-2_BIB1","series-title":"Scheduling Algorithms","author":"Brucker","year":"1998"},{"key":"10.1016\/S0167-6377(01)00068-2_BIB2","unstructured":"P. Brucker, J. Hurink, S. Knust, unpublished."},{"key":"10.1016\/S0167-6377(01)00068-2_BIB3","series-title":"Handbook of Combinatorial Optimization","first-page":"21","article-title":"A review of machine scheduling: complexity, algorithms and approximability","author":"Chen","year":"1998"},{"key":"10.1016\/S0167-6377(01)00068-2_BIB4","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/S0167-6377(01)00068-2_BIB5","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(01)00068-2_BIB6","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00068-2_BIB7","series-title":"Handbook on Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1993"},{"key":"10.1016\/S0167-6377(01)00068-2_BIB8","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(01)00068-2_BIB9","unstructured":"P. Rosenfeld, unpublished."},{"key":"10.1016\/S0167-6377(01)00068-2_BIB10","unstructured":"V.G. Timkovsky, Identical parallel machines vs. unit-time shops and preemption vs. chains in scheduling complexity, Technical Report, Department of Computing and Software, McMaster University, Hamilton, Ontario, 1998."},{"key":"10.1016\/S0167-6377(01)00068-2_BIB11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0166-218X(98)00032-8","article-title":"Is a unit-time job shop not easier than identical parallel machines?","volume":"85","author":"Timkovsky","year":"1998","journal-title":"Discrete Appl. Math."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000682?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000682?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:54:49Z","timestamp":1556387689000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701000682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0167637701000682"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00068-2","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}