{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:42:05Z","timestamp":1760384525979},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,12,10]],"date-time":"2005-12-10T00:00:00Z","timestamp":1134172800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s00291-005-0013-4","type":"journal-article","created":{"date-parts":[[2005,12,9]],"date-time":"2005-12-09T17:44:21Z","timestamp":1134150261000},"page":"177-198","source":"Crossref","is-referenced-by-count":30,"title":["Minimizing earliness\u2013tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint"],"prefix":"10.1007","volume":"28","author":[{"given":"Lars","family":"M\u00f6nch","sequence":"first","affiliation":[]},{"given":"Robert","family":"Unbehaun","sequence":"additional","affiliation":[]},{"given":"You In","family":"Choung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,12,10]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"KR Baker","year":"1990","unstructured":"Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38:22\u201336","journal-title":"Oper Res"},{"issue":"8","key":"13_CR2","doi-asserted-by":"crossref","first-page":"1621","DOI":"10.1080\/00207540310001636994","volume":"42","author":"H Balasubramanian","year":"2004","unstructured":"Balasubramanian H, M\u00f6nch L, Fowler JW, Pfund M (2004) Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness. Int J Prod Res 42(8):1621\u20131638","journal-title":"Int J Prod Res"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(93)90030-K","volume":"13","author":"V Chandru","year":"1993","unstructured":"Chandru V, Lee CY, Uzsoy R (1993a) Minimizing total completion time on a batch processing machine with job families. Oper Res Lett 13:61\u201365","journal-title":"Oper Res Lett"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1080\/00207549308956847","volume":"31","author":"V Chandru","year":"1993","unstructured":"Chandru V, Lee CY, Uzsoy R (1993b) Minimizing total completion time on batch processing machines. Int J Prod Res 31:2097\u20132121","journal-title":"Int J Prod Res"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/S0305-0548(00)00107-6","volume":"29","author":"SA Cho","year":"2002","unstructured":"Cho SA, Kim C-B, Lee DH (2002) Single machine MAD\/Tmax problem with a common due date. Comput Oper Res 29:1099\u20131113","journal-title":"Comput Oper Res"},{"key":"13_CR6","unstructured":"Choung YI, M\u00f6nch L (2003) A genetic algorithm approach for minimizing earliness and tardiness on a burn-in oven. Proceedings 10th Annual Industrial Engineering Research Conference, Portland, Oregon, USA, Paper on Proceedings-CD"},{"key":"13_CR7","first-page":"197","volume":"4","author":"L DuPont","year":"1997","unstructured":"DuPont L, Ghazvini FJ (1997) A branch and bound algorithm for minimizing mean flow time on a single batch processing machine. Int J Ind Eng 4:197\u2013203","journal-title":"Int J Ind Eng"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0360-8352(02)00181-X","volume":"44","author":"M Feldmann","year":"2003","unstructured":"Feldmann M, Biskup D (2003) Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches. Comput Ind Eng 44:307\u2013323","journal-title":"Comp Ind Eng"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","volume":"39","author":"NG Hall","year":"1991","unstructured":"Hall NG, Posner ME (1991) Earliness\u2013tardiness scheduling Problem I: weighted deviation of completion times about a common due date. Oper Res 39:836\u2013846","journal-title":"Oper Res"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1287\/opre.45.6.874","volume":"45","author":"DS Hochbaum","year":"1997","unstructured":"Hochbaum DS, Landy D (1997) Scheduling semiconductor burn-in operations to minimize total flowtime. Oper Res 45:874\u2013885","journal-title":"Oper Res"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1002\/nav.3800280411","volume":"28","author":"JJ Kanet","year":"1981","unstructured":"Kanet JJ (1981) Minimizing the average deviation of job completion times about a common due date. Nav Res Logist Q 28:643\u2013651","journal-title":"Nav Res Logist Q"},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee CY, Uzsoy R, Martin-Vega LA (1992) Efficient algorithms for scheduling semiconductor burn-in Operations. Oper Res 40:764\u2013775","journal-title":"Oper Res"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/0377-2217(95)00332-0","volume":"96","author":"CL Li","year":"1997","unstructured":"Li CL, Lee CY (1997) Scheduling with agreeable release times and due dates on a batch processing machine. Eur J Oper Res 96:564\u2013569","journal-title":"Eur J Oper Res"},{"key":"13_CR14","volume-title":"Genetic algorithms+data structures=evolution programs, 3rd revised and extended edn","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z (1996) Genetic algorithms+data structures=evolution programs, 3rd revised and extended edn. Springer, Berlin Heidelberg New York"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(98)00391-9","volume":"120","author":"CS Sung","year":"2000","unstructured":"Sung CS, Choung YI (2000) Minimizing makespan on a single burn-in oven in semiconductor manufacturing. Eur J Oper Res 120:559\u2013574","journal-title":"Eur J Oper Res"},{"key":"13_CR16","unstructured":"Sung CS, Choung YI, Fowler JW (2002a) Heuristic algorithm for minimizing earliness\u2013tardiness on single burn-in oven in semiconductor manufacturing. Proceedings of 2002 International Conference of Modeling and Analysis for Semiconductor Manufacturing (MASM), Tempe, Arizona, pp 217\u2013222"},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1016\/S0305-0548(00)00098-8","volume":"29","author":"CS Sung","year":"2002","unstructured":"Sung CS, Choung YI, Hong JM, Kim YH (2002b) Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals. Comput Oper Res 29:995\u20131007","journal-title":"Comput Oper Res"},{"key":"13_CR18","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy R (1994) Scheduling a single batch processing machine with non-identical job sizes. Int J Prod Res 32:1615\u20131635","journal-title":"Int J Prod Res"},{"key":"13_CR19","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1080\/07408179408966627","volume":"26","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy R, Lee C-Y, Martin-Vega LA (1994) A review of production planning and scheduling models in the semiconductor industry. Part II: shop floor control. IIE Trans 26:44\u201355","journal-title":"IIE Trans"},{"key":"13_CR20","unstructured":"Wall M (1996) GaLib: A C++ library of genetic algorithm components. http:\/\/www.lancet.mitedu\/ga\/"},{"key":"13_CR21","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S Webster","year":"1995","unstructured":"Webster S, Baker KR (1995) Scheduling groups of jobs on a single machine. Oper Res 43:692\u2013703","journal-title":"Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-005-0013-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-005-0013-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-005-0013-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:53Z","timestamp":1559041193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-005-0013-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12,10]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["13"],"URL":"https:\/\/doi.org\/10.1007\/s00291-005-0013-4","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12,10]]}}}