{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T02:34:21Z","timestamp":1785033261172,"version":"3.55.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1016\/s0305-0548(97)00023-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"1169-1174","source":"Crossref","is-referenced-by-count":29,"title":["Two-stage flowshop scheduling with a common second-stage machine"],"prefix":"10.1016","volume":"24","author":[{"given":"Ceyda","family":"O\u01e7uz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bertrand M.T.","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T.C.","family":"Edwin Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00023-3_BIB1","first-page":"445","article-title":"Sequencing and scheduling: Algorithms and complexity","author":"Lawler","year":"1989"},{"key":"10.1016\/S0305-0548(97)00023-3_BIB2","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\/S0305-0548(97)00023-3_BIB3","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","article-title":"Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem","volume":"39","author":"Lee","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00023-3_BIB4","doi-asserted-by":"crossref","first-page":"61","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\/S0305-0548(97)00023-3_BIB5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1287\/mnsc.5.3.293","article-title":"Sequencing n jobs on two machines with arbitrary time lags","volume":"5","author":"Mitten","year":"1958","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00023-3_BIB6","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.13.3.400","article-title":"Application of the branch and bound technique to some flowshop scheduling problems","volume":"13","author":"Ignall","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00023-3_BIB7","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1287\/opre.15.3.473","article-title":"Flow-shop scheduling with the branch and bound method","volume":"15","author":"McMahon","year":"1967","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00023-3_BIB8","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.25.1.70","article-title":"Optimal two-machine ordering in the 3\u00d7n flow shop problem","volume":"25","author":"Szwarc","year":"1977","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00023-3_BIB9","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/opre.23.1.62","article-title":"A comparative survey of flow shop algorithms","volume":"23","author":"Baker","year":"1975","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00023-3_BIB10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.26.1.53","article-title":"A general bounding scheme for the permutation flowshop problem","volume":"26","author":"Lageweg","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00023-3_BIB11","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/moor.10.4.576","article-title":"Analysis of heuristics for two-machine flow shop sequencing subject to release dates","volume":"10","author":"Potts","year":"1985","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(97)00023-3_BIB12","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:21:35Z","timestamp":1555190495000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054897000233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":12,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0305054897000233"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00023-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}