{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:15:22Z","timestamp":1758824122042},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0377-2217(01)00356-3","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T15:46:28Z","timestamp":1034264788000},"page":"245-261","source":"Crossref","is-referenced-by-count":16,"title":["Nonpreemptive flowshop scheduling with machine dominance"],"prefix":"10.1016","volume":"139","author":[{"given":"Ond\u0159ej","family":"\u010cepek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masanori","family":"Okada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milan","family":"Vlach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00356-3_BIB1","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/nav.3800290311","article-title":"Flowshop\/no-idle or no-wait scheduling to minimize the sum of completion times","volume":"29","author":"Adiri","year":"1982","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/opre.31.2.381","article-title":"Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints","volume":"31","author":"Baker","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB3","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"issue":"3","key":"10.1016\/S0377-2217(01)00356-3_BIB4","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one machine is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB6","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":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/nav.3800220205","article-title":"Optimal schedules for special structure flow-shops","volume":"22","author":"Gupta","year":"1975","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"10.1016\/S0377-2217(01)00356-3_BIB8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0305-0548(94)E0007-T","article-title":"Flowshop scheduling with dominant machines","volume":"22","author":"Ho","year":"1995","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(01)00356-3_BIB9","doi-asserted-by":"crossref","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two-and three-stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB10","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","article-title":"Sequencing jobs to minimize total weighted completion time subject to precedence constraints","volume":"2","author":"Lawler","year":"1978","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02248588","article-title":"A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs","volume":"26","author":"Lawler","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB13","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"10.1016\/S0377-2217(01)00356-3_BIB14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1051\/ro\/1983170201051","article-title":"A concise survey of efficiently solvable special cases of the permutation flow-shop problem","volume":"17","author":"Monma","year":"1983","journal-title":"RAIRO"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB15","first-page":"170","article-title":"The order of n items processed on m machines","volume":"3","author":"Nabeshima","year":"1961","journal-title":"Journal of Operations Research Society of Japan"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB16","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0377-2217(92)90175-9","article-title":"Flow-shops with a dominant machine","volume":"62","author":"van den Nouweland","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB17","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1145\/62.65","article-title":"The three-machine no-wait flow shop problem is NP-complete","volume":"31","author":"R\u00f6ck","year":"1984","journal-title":"Journal of ACM"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01919082","article-title":"Some new results in flow shop scheduling","volume":"28","author":"R\u00f6ck","year":"1984","journal-title":"Zeitschrift f\u00fcr Operational Research"},{"key":"10.1016\/S0377-2217(01)00356-3_BIB19","series-title":"Scheduling Theory: Multi-Stage Systems","author":"Tanaev","year":"1994"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701003563?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701003563?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T20:24:53Z","timestamp":1556569493000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701003563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0377221701003563"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00356-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}