{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T19:37:31Z","timestamp":1769456251685,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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 &amp; Operations Research"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0305-0548(00)00078-2","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"807-819","source":"Crossref","is-referenced-by-count":141,"title":["Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure"],"prefix":"10.1016","volume":"29","author":[{"given":"Lionel","family":"Dupont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clarisse","family":"Dhaenens-Flipo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00078-2_BIB1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","article-title":"Efficient 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)00078-2_BIB2","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)00078-2_BIB3","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)00078-2_BIB4","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":"40","author":"Ahmadi","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00078-2_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","article-title":"Scheduling a batching machine","volume":"1","author":"Brucker","year":"1998","journal-title":"Journal of Scheduling"},{"key":"10.1016\/S0305-0548(00)00078-2_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)00078-2_BIB7","first-page":"197","article-title":"Branch and bound method for single batch processing machine with mean flow time criteria","volume":"4","author":"Dupont","year":"1997","journal-title":"International Journal of Industrial Engineering: Practice and Theory"},{"key":"10.1016\/S0305-0548(00)00078-2_BIB8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1111\/j.1937-5956.1997.tb00415.x","article-title":"Minimizing total weighted completion time on a single batch processing machine","volume":"6","author":"Uzsoy","year":"1997","journal-title":"Production and Operations Management"},{"key":"10.1016\/S0305-0548(00)00078-2_BIB9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/002075499192020","article-title":"Minimizing makespan on a single batch processing machine with dynamic job arrivals","volume":"1","author":"Lee","year":"1999","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(00)00078-2_BIB10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0278-6125(98)80008-3","article-title":"Scheduling a single batch processing machine with secondary resource constraints","volume":"17","author":"Kempf","year":"1998","journal-title":"Journal of Manufacturing Systems"},{"key":"10.1016\/S0305-0548(00)00078-2_BIB11","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)00078-2_BIB12","first-page":"165","article-title":"Minimizing total tardiness on a batch processing machine with incompatible job families","volume":"31","author":"Mehta","year":"1998","journal-title":"IIE Transactions on Scheduling and Logistics"},{"key":"10.1016\/S0305-0548(00)00078-2_BIB13","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)00078-2_BIB14","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)00078-2_BIB15","unstructured":"Kubiak W, Jolai Ghazvini F. Minimizing earliness\/tardiness criteria on a single batch processing machine with families of jobs. Proceeding of the 2nd Annual International Conference on Industrial Engineering, vol. 2, San Diego, California, USA, 12\u201315 November 1997. p. 785\u201390."},{"key":"10.1016\/S0305-0548(00)00078-2_BIB16","unstructured":"Dobson G, Nambinadom RS. The batch loading and scheduling problem. Research Report, Simon School of Business Administration, University of Rochester, Rochester, NY, 1992."},{"key":"10.1016\/S0305-0548(00)00078-2_BIB17","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","article-title":"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)00078-2_BIB18","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0925-5273(98)00067-X","article-title":"Minimizing mean flow time criteria on a single batch processing machine with non-identical job sizes","volume":"55","author":"Jolai Ghazvini","year":"1998","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0305-0548(00)00078-2_BIB19","first-page":"431","article-title":"Minimizing makespan on a single batch processing machine with non-identical job sizes","volume":"32","author":"Dupont","year":"1998","journal-title":"European Journal of Automation (JESA)"},{"key":"10.1016\/S0305-0548(00)00078-2_BIB20","series-title":"Algorithm design for computer system design","first-page":"p49","article-title":"Approximation algorithms for bin\u2013packing \u2013 an updated survey","author":"Coffman","year":"1984"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000782?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000782?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:27:53Z","timestamp":1556508473000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0305054800000782"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00078-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}