{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:08:48Z","timestamp":1760044128397},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":[[1993,8]]},"DOI":"10.1016\/0305-0548(93)90115-y","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"597-611","source":"Crossref","is-referenced-by-count":20,"title":["Two machine open shop scheduling problem with setup, processing and removal times separated"],"prefix":"10.1016","volume":"20","author":[{"given":"Vitaly A.","family":"Strusevich","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(93)90115-Y_BIB1","article-title":"On non-permutation solutions to some two-machine flow shop scheduling problems","author":"Strusevich","year":"1991"},{"key":"10.1016\/0305-0548(93)90115-Y_BIB2","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":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(93)90115-Y_BIB3","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":"Int. J. Prod. Res."},{"key":"10.1016\/0305-0548(93)90115-Y_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules with set-up times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(93)90115-Y_BIB5","article-title":"Two machine flow shop no-wait scheduling problem with setup, processing and removal times separated","author":"Strusevich","year":"1990"},{"key":"10.1016\/0305-0548(93)90115-Y_BIB6","article-title":"Complexity aspects of shop scheduling problems","author":"Strusevich","year":"1991"},{"key":"10.1016\/0305-0548(93)90115-Y_BIB7","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open shop scheduling to minimize finish time","volume":"23","author":"Gonzalez","year":"1976","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489390115Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489390115Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:25:21Z","timestamp":1552929921000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489390115Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["030505489390115Y"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(93)90115-y","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}