{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T00:13:12Z","timestamp":1676851992731},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"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":[[2005,5]]},"DOI":"10.1016\/j.orl.2004.08.001","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T17:43:05Z","timestamp":1096393385000},"page":"263-266","source":"Crossref","is-referenced-by-count":1,"title":["The -machine flowshop problem with unit-time operations and intree precedence constraints"],"prefix":"10.1016","volume":"33","author":[{"given":"Igor","family":"Averbakh","sequence":"first","affiliation":[]},{"given":"Oded","family":"Berman","sequence":"additional","affiliation":[]},{"given":"Ilya","family":"Chernykh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2004.08.001_bib1","unstructured":"I. Averbakh, O. Berman, I. Chernykh. A polynomial algorithm for minimizing the total completion time in m-machine flowshop with unit-time operations and intree precedence constraints. Working paper, Rotman school of management, University of Toronto, 2003."},{"key":"10.1016\/j.orl.2004.08.001_bib2","unstructured":"P. Baptiste, P. Brucker, S. Knust, V. Timkovsky. Fourteen notes on equal-processing-time scheduling, Technical report, , 2002."},{"key":"10.1016\/j.orl.2004.08.001_bib3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s006070050036","article-title":"Complexity results for single-machine problems with positive finish-start time-lags","volume":"63","author":"Brucker","year":"1999","journal-title":"Computing"},{"key":"10.1016\/j.orl.2004.08.001_bib4","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."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763770400104X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763770400104X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T13:52:24Z","timestamp":1549201944000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016763770400104X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["S016763770400104X"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2004.08.001","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}