{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:25:43Z","timestamp":1759847143858},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":[[2002,3]]},"DOI":"10.1016\/s0305-0548(00)00071-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:58:43Z","timestamp":1027616323000},"page":"275-294","source":"Crossref","is-referenced-by-count":39,"title":["Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed"],"prefix":"10.1016","volume":"29","author":[{"given":"Chang Sup","family":"Sung","sequence":"first","affiliation":[]},{"given":"Young Hwan","family":"Kim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00071-X_BIB1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/66.79719","article-title":"Dynamic batching heuristic for simultaneous processing","volume":"4","author":"Glassey","year":"1991","journal-title":"IEEE Transactions on Semiconductor Manufacturing"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB2","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.40.4.750","article-title":"Batching and scheduling jobs on batch and discrete processors","volume":"39","author":"Ahmadi","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB3","first-page":"47","article-title":"A review of production planning and scheduling models in the semiconductor industry\u2014Part I: system characteristics, performance evaluation and production planning","volume":"24","author":"Uzsoy","year":"1992","journal-title":"IIE Transactions on Scheduling and Logistics"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB4","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","article-title":"Scheduling groups of jobs on a single machine","volume":"43","author":"Webster","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(93)90030-K","article-title":"Minimizing total completion time on a batch processing machine with job families","volume":"13","author":"Chandru","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB6","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1080\/00207549308956847","article-title":"Minimizing total completion time on batch processing machines","volume":"31","author":"Chandru","year":"1993","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB7","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1287\/opre.45.6.874","article-title":"Scheduling semiconductor burn-in operations to minimize total flowtime","volume":"45","author":"Hochbaum","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB8","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","article-title":"Efficient algorithms for scheduling semiconductor burn-in operations","volume":"40","author":"Lee","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB9","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/0377-2217(95)00332-0","article-title":"Scheduling with agreeable release times and due dates on a batch processing machine","volume":"96","author":"Li","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB10","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(98)00391-9","article-title":"Minimizing makespan on a single burn-in oven in semiconductor manufacturing","volume":"120","author":"Sung","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB11","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","article-title":"Scheduling a single batch processing machine with non-identical job sizes","volume":"32","author":"Uzsoy","year":"1994","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB12","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1080\/07408179808966485","article-title":"Batching and scheduling to minimize the makespan in the two-machine flowshop","volume":"30","author":"Cheng","year":"1998","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","article-title":"Scheduling algorithms for a single batch processing machine","volume":"5","author":"Ikura","year":"1986","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB14","doi-asserted-by":"crossref","first-page":"2685","DOI":"10.1080\/00207549508904839","article-title":"Scheduling batch processing machines with incompatible job families","volume":"33","author":"Uzsoy","year":"1995","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/07408179808966448","article-title":"Minimizing total tardiness on a batch processing machine with incompatible job families","volume":"30","author":"Mehta","year":"1998","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/03052159708941133","article-title":"Minimizing maximum completion time in a two-batch-processing-machine flowshop with dynamic arrivals allowed","volume":"28","author":"Sung","year":"1997","journal-title":"Engineering Optimization"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB17","doi-asserted-by":"crossref","unstructured":"Sung CS, Min JI. Scheduling in a two-machine flowshop with batch processing machine(s) for earliness\/tardiness measure under a common due date. European Journal of Operational Research, to appear.","DOI":"10.1016\/S0377-2217(99)00447-6"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0377-2217(99)00031-4","article-title":"A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines","volume":"121","author":"Sung","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB19","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1287\/opre.16.3.687","article-title":"A proof of the optimality of the shortest remaining processing time discipline","volume":"6","author":"Schrage","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00071-X_BIB20","unstructured":"CPLEX Optimization, Inc. Incline Village, NV. Using the CPLEX callable library, Version 4.0, 1995."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505480000071X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505480000071X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T12:21:17Z","timestamp":1556194877000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505480000071X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S030505480000071X"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00071-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}