{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T01:04:07Z","timestamp":1770426247003,"version":"3.49.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"5","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":["Operations Research Letters"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0167-6377(00)00033-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:48Z","timestamp":1027594788000},"page":"223-229","source":"Crossref","is-referenced-by-count":64,"title":["An improved heuristic for two-machine flowshop scheduling with an availability constraint"],"prefix":"10.1016","volume":"26","author":[{"given":"T.C.Edwin","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Guoqing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(00)00033-X_BIB1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0020-0190(99)00094-0","article-title":"Two-machine flowshop scheduling with consecutive availability constraints","volume":"71","author":"Cheng","year":"1999","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0167-6377(00)00033-X_BIB2","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 Res. Logist. Quart."},{"key":"10.1016\/S0167-6377(00)00033-X_BIB3","article-title":"A branch and bound algorithm for two machine flow shop with limited machine availability","volume":"38","author":"Kubiak","year":"1997","journal-title":"The Abstracts of the Tenth Meeting of the European Chapter on Combinatorial Optimization"},{"key":"10.1016\/S0167-6377(00)00033-X_BIB4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0167-6377(96)00041-7","article-title":"Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint","volume":"20","author":"Lee","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(00)00033-X_BIB5","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/S0377-2217(97)00452-9","article-title":"Two-machine flowshop scheduling with availability constraints","volume":"114","author":"Lee","year":"1999","journal-title":"European J. Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763770000033X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763770000033X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T13:54:30Z","timestamp":1556373270000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016763770000033X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S016763770000033X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(00)00033-x","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}