{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T21:06:34Z","timestamp":1726520794608},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"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":[[2000,5]]},"DOI":"10.1016\/s0167-6377(00)00019-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:36:39Z","timestamp":1027650999000},"page":"165-173","source":"Crossref","is-referenced-by-count":20,"title":["A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups"],"prefix":"10.1016","volume":"26","author":[{"given":"Jeffrey B.","family":"Sidney","sequence":"first","affiliation":[]},{"given":"Chris N.","family":"Potts","sequence":"additional","affiliation":[]},{"given":"Chelliah","family":"Sriskandarajah","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1974","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","key":"10.1016\/S0167-6377(00)00019-5_BIB1"},{"key":"10.1016\/S0167-6377(00)00019-5_BIB2","series-title":"Handbook of Combinatorial Optimization, Vol. 3","first-page":"21","article-title":"A review of machine scheduling: complexity, algorithms and approximability","author":"Chen","year":"1998"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0167-6377(00)00019-5_BIB3"},{"key":"10.1016\/S0167-6377(00)00019-5_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 travelling salesman problem","volume":"12","author":"Gilmore","year":"1964","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(00)00019-5_BIB5","series-title":"The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization","first-page":"87","article-title":"Well-solved special cases","author":"Gilmore","year":"1985"},{"key":"10.1016\/S0167-6377(00)00019-5_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\/S0167-6377(00)00019-5_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: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(00)00019-5_BIB8","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1016\/S0305-0548(97)00018-X","article-title":"Two-stage no-wait scheduling models with setup and removal times separated","volume":"24","author":"Gupta","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0167-6377(00)00019-5_BIB9","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":"Oper. Res."},{"year":"1989","series-title":"Sequencing and scheduling: algorithms and complexity, Report BS-R8909, Center for Mathematics and Computer Science","author":"Lawler","key":"10.1016\/S0167-6377(00)00019-5_BIB10"},{"key":"10.1016\/S0167-6377(00)00019-5_BIB11","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/0377-2217(93)90029-M","article-title":"Two-machine group scheduling problem with blocking and anticipatory setups","volume":"69","author":"Logendran","year":"1993","journal-title":"Eur. J. Oper. Res."},{"year":"1995","series-title":"Scheduling Theory, Algorithms, and Systems","author":"Pinedo","key":"10.1016\/S0167-6377(00)00019-5_BIB12"},{"key":"10.1016\/S0167-6377(00)00019-5_BIB13","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1145\/62.65","article-title":"The three machine no-wait flowshop problem is NP-complete","volume":"31","author":"R\u00f6ck","year":"1984","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637700000195?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637700000195?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T11:28:20Z","timestamp":1555241300000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637700000195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0167637700000195"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(00)00019-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"type":"print","value":"0167-6377"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}