{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:21:57Z","timestamp":1759666917500},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":[[2000,6]]},"DOI":"10.1016\/s0377-2217(99)00253-2","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"229-240","source":"Crossref","is-referenced-by-count":12,"title":["Heuristics for the two-stage job shop scheduling problem with a bottleneck machine"],"prefix":"10.1016","volume":"123","author":[{"given":"I.G.","family":"Drobouchevitch","sequence":"first","affiliation":[]},{"given":"V.A.","family":"Strusevich","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00253-2_BIB1","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1057\/jors.1995.28","article-title":"Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage","volume":"46","author":"Chen","year":"1995","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB2","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1287\/opre.44.6.891","article-title":"A new heuristic three-machine flow shop scheduling","volume":"44","author":"Chen","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s001860050033","article-title":"Heuristics for short route job shop scheduling problems","volume":"48","author":"Drobouchevitch","year":"1998","journal-title":"Mathematical Methods of Operations Research"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flow shop and job shop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/opre.26.1.36","article-title":"Flow shop and job shop schedules: complexity and approximation","volume":"26","author":"Gonzalez","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB6","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1080\/002075497194868","article-title":"A flowshop scheduling problem with two operations per job","volume":"35","author":"Gupta","year":"1997","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01585870","article-title":"Approximability of flow shop scheduling","volume":"82","author":"Hall","year":"1998","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB8","unstructured":"J.W. Herrmann, C.-Y. Lee, Three-machine look-ahead scheduling problems, Research report No. 92-93, Department of Industrial Engineering, University of Florida, Gainesville, Florida, USA, 1992"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/nav.3800030307","article-title":"An extension of Johnson's results on job lot scheduling","volume":"3","author":"Jackson","year":"1956","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-machine production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB11","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity. in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Handbooks in Operations Research and Management Science, vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 455\u2013522"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0167-6377(94)90026-4","article-title":"Minimizing makespan in hybrid flowshops","volume":"16","author":"Lee","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB13","unstructured":"Y.D. Neumytov, S.V. Sevast'janov, An approximation algorithm with an exact bound for the three-machine problem with the opposite routes, Upravlyaemye Sistemy 31 (1993) 53\u201365 (in Russian)"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB14","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1016\/S0305-0548(97)00023-3","article-title":"Two-stage flow shop scheduling with a common second-stage machine","volume":"24","author":"O\u01e7uz","year":"1997","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB15","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/opre.43.2.346","article-title":"The two-stage assembly scheduling problem: Complexity and approximation","volume":"43","author":"Potts","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB16","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(94)90036-1","article-title":"On some geometric methods in scheduling theory","volume":"55","author":"Sevast'janov","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB17","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1287\/moor.20.1.90","article-title":"Vector summation in Banach space and polynomial algorithms for flow shops and open shops","volume":"20","author":"Sevast'janov","year":"1995","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB18","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/S009753979222676X","article-title":"Improved approximation algorithms for shop scheduling problems","volume":"23","author":"Shmoys","year":"1994","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00253-2_BIB19","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1287\/opre.45.2.288","article-title":"Short shop schedules","volume":"45","author":"Williamson","year":"1997","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002532?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002532?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T22:57:35Z","timestamp":1556146655000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799002532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0377221799002532"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00253-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}