{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T21:28:48Z","timestamp":1771882128369,"version":"3.50.1"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2009,8]]},"abstract":"<jats:p> This study addresses a two-stage flowshop with a batch machine in stage 1 and a discrete machine in stage 2, subject to the constraint that the input buffer of the discrete machine can only host limited number of jobs. The batch machine processes a batch of jobs simultaneously, and the discrete machine processes one job at a time. The objective function of the problem is the makespan minimization. Several properties are proposed to solve the special case of the problem optimally. An effective heuristic is presented, and a branch-and-bound procedure is proposed for benchmarking. Extensive experimentation shows that the heuristic yields good results. <\/jats:p>","DOI":"10.1142\/s0217595909002328","type":"journal-article","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T01:24:50Z","timestamp":1253064290000},"page":"503-522","source":"Crossref","is-referenced-by-count":6,"title":["A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE"],"prefix":"10.1142","volume":"26","author":[{"given":"LING-HUEY","family":"SU","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, Chung-Yuan Christian University, Chung-Li, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAR-LI","family":"YANG","sequence":"additional","affiliation":[{"name":"Department of Information Management, National Formosa University, Huwei, Yunlin, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HOU-KUAN","family":"CHOU","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Chung-Yuan Christian University, Chung-Li, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00114-7"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199803)45:2<141::AID-NAV2>3.0.CO;2-8"},{"key":"rf3","first-page":"750","volume":"39","author":"Ahmadi J. H.","journal-title":"Operations Research"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.21.9.989"},{"key":"rf5","series-title":"A Guide to the Theory of NP-Completeness","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1979"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1080\/00207549008942855"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00017-4"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1145\/322203.322213"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00264-9"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.23.2.216"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2006.05.006"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00071-X"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595909002328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:10:36Z","timestamp":1565187036000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595909002328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":12,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2009,8]]}},"alternative-id":["10.1142\/S0217595909002328"],"URL":"https:\/\/doi.org\/10.1142\/s0217595909002328","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}