{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T22:19:29Z","timestamp":1770502769882,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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,11]]},"DOI":"10.1016\/s0305-0548(97)00018-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"1025-1031","source":"Crossref","is-referenced-by-count":32,"title":["Two-stage no-wait scheduling models with setup and removal times separated"],"prefix":"10.1016","volume":"24","author":[{"given":"J.N.D.","family":"Gupta","sequence":"first","affiliation":[]},{"given":"V.A.","family":"Strusevich","sequence":"additional","affiliation":[]},{"given":"C.M.","family":"Zwaneveld","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00018-X_BIB1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0895-7177(90)90368-W","article-title":"Scheduling groups of jobs in the two-machine flow shop","volume":"13","author":"Baker","year":"1990","journal-title":"Mathematical and Computer Modelling"},{"key":"10.1016\/S0305-0548(97)00018-X_BIB2","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0377-2217(94)90407-3","article-title":"Scheduling a two-stage hybrid flowshop with separable setup and removal times","volume":"77","author":"Gupta","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(97)00018-X_BIB3","first-page":"455","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1993"},{"key":"10.1016\/S0305-0548(97)00018-X_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)00018-X_BIB5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/05695557908974469","article-title":"Optimal two-stage production scheduling with setup times separated","volume":"11","author":"Yoshida","year":"1979","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0305-0548(97)00018-X_BIB6","first-page":"305","article-title":"On non-permutation solutions to some two-machine flow shop scheduling models","volume":"39","author":"Strusevich","year":"1994","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"10.1016\/S0305-0548(97)00018-X_BIB7","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1002\/nav.3800290313","article-title":"Sequencing n jobs on two machines with setup, processing and removal times separated","volume":"29","author":"Sule","year":"1982","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(97)00018-X_BIB8","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1080\/00207548308942406","article-title":"Sequencing on two and three machines with setup, processing and removal times separated","volume":"21","author":"Sule","year":"1983","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(97)00018-X_BIB9","doi-asserted-by":"crossref","first-page":"206","DOI":"10.15807\/jorsj.29.206","article-title":"Flowshop schedules with sequence dependent setup times","volume":"29","author":"Gupta","year":"1986","journal-title":"Journal of Operations Research Society of Japan"},{"key":"10.1016\/S0305-0548(97)00018-X_BIB10","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0377-2217(86)90037-8","article-title":"The two-machine sequence-dependent flowshop scheduling problem","volume":"24","author":"Gupta","year":"1986","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(97)00018-X_BIB11","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\/S0305-0548(97)00018-X_BIB12","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open shop schedules to minimize finish time","volume":"23","author":"Gonzalez","year":"1976","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0305-0548(97)00018-X_BIB13","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0305-0548(93)90115-Y","article-title":"Two-machine open shop scheduling problem with setup, processing and removal times separated","volume":"20","author":"Strusevich","year":"1993","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(97)00018-X_BIB14","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)00018-X_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\/S0305-0548(97)00018-X_BIB16","doi-asserted-by":"crossref","first-page":"665","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\/S0305-0548(97)00018-X_BIB17","series-title":"The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization","first-page":"87","article-title":"Well solved special cases","author":"Gilmore","year":"1986"},{"key":"10.1016\/S0305-0548(97)00018-X_BIB18","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 the Association for Computing Machinery"},{"key":"10.1016\/S0305-0548(97)00018-X_BIB19","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/moor.4.4.448","article-title":"Complexity of scheduling shop with no wait in process","volume":"4","author":"Sahni","year":"1979","journal-title":"Mathematics of Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505489700018X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505489700018X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:27:38Z","timestamp":1556396858000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505489700018X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":19,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S030505489700018X"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00018-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}