{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:08:43Z","timestamp":1760706523874},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00102-1","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"101-107","source":"Crossref","is-referenced-by-count":9,"title":["A polynomial algorithm for a two-machine no-wait job-shop scheduling problem"],"prefix":"10.1016","volume":"106","author":[{"given":"Svetlana A.","family":"Kravchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00102-1_BIB1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02283747","article-title":"Scheduling unit-time tasks on flow-shops under resource constraints","volume":"16","author":"B\u0142a\u017cewicz","year":"1988","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00102-1_BIB2","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","article-title":"Scheduling independent tasks to reduce mean finishing time","volume":"17","author":"Bruno","year":"1974","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0377-2217(97)00102-1_BIB3","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(97)00102-1_BIB4","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","article-title":"Sequencing a one state-variable machine: a solvable case of the traveling salesman problem","volume":"12","author":"Gilmore","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00102-1_BIB5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/moor.7.1.57","article-title":"Unit execution time shop problems","volume":"7","author":"Gonzalez","year":"1982","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(97)00102-1_BIB6","first-page":"220","article-title":"No-wait shop scheduling: computational complexity and approximate algorithms","volume":"25","author":"Goyal","year":"1988","journal-title":"Opsearch"},{"key":"10.1016\/S0377-2217(97)00102-1_BIB7","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","article-title":"A survey of machine scheduling problems with blocking and no-wait in process","volume":"44","author":"Hall","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00102-1_BIB8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0377-2217(89)90225-7","article-title":"A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem","volume":"43","author":"Kubiak","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00102-1_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01919082","article-title":"Some new results in no-wait flowshop scheduling","volume":"28","author":"R\u00f6ck","year":"1984","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"10.1016\/S0377-2217(97)00102-1_BIB10","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/0377-2217(86)90036-6","article-title":"Some no-wait shops scheduling problems: complexity aspects","volume":"24","author":"Sriskandarajah","year":"1986","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00102-1_BIB11","first-page":"46","article-title":"On the complexity of scheduling an arbitrary system","volume":"5","author":"Timkovsky","year":"1985","journal-title":"Soviet Journal of Computer and System Sciences"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797001021?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797001021?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T19:30:05Z","timestamp":1555961405000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797001021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797001021"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00102-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}