{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T11:16:00Z","timestamp":1769166960157,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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,10]]},"DOI":"10.1016\/s0305-0548(01)00031-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"1621-1640","source":"Crossref","is-referenced-by-count":130,"title":["A genetic algorithm to minimize maximum lateness on a batch processing machine"],"prefix":"10.1016","volume":"29","author":[{"given":"Cheng-Shuo","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reha","family":"Uzsoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(01)00031-4_BIB1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/002075499192020","article-title":"Minimizing Makespan on a Single Processing Machine with dynamic job arrivals","volume":"37","author":"Lee","year":"1999","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(01)00031-4_BIB2","series-title":"Decomposition methods for complex factory scheduling problems","author":"Ovacik","year":"1997"},{"key":"10.1016\/S0305-0548(01)00031-4_BIB3","unstructured":"Lawler et al., 1993."},{"key":"10.1016\/S0305-0548(01)00031-4_BIB4","unstructured":"Li, Lee, 1997."},{"key":"10.1016\/S0305-0548(01)00031-4_BIB5","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","article-title":"Genetic algorithms and random keys for sequencing and optimization","volume":"6","author":"Bean","year":"1994","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0305-0548(01)00031-4_BIB6","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(01)00031-4_BIB7","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(01)00031-4_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(01)00031-4_BIB9","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(01)00031-4_BIB10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(93)90030-K","article-title":"Minimizing total completion time on batch processing machines with job families","volume":"13","author":"Chandru","year":"1993","journal-title":"Operation Research Letters"},{"key":"10.1016\/S0305-0548(01)00031-4_BIB11","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(01)00031-4_BIB12","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(01)00031-4_BIB13","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(01)00031-4_BIB14","doi-asserted-by":"crossref","first-page":"2605","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(01)00031-4_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(01)00031-4_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(01)00031-4_BIB17","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(01)00031-4_BIB18","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(01)00031-4_BIB19","series-title":"Genetic algorithms in search, optimization and machine learning.","author":"Goldberg","year":"1989"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000314?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000314?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:23:11Z","timestamp":1555118591000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054801000314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":19,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0305054801000314"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(01)00031-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}