{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:16:17Z","timestamp":1762521377622},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T00:00:00Z","timestamp":1283644800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Adv Manuf Technol"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s00170-010-2921-y","type":"journal-article","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T08:19:11Z","timestamp":1283588351000},"page":"251-265","source":"Crossref","is-referenced-by-count":18,"title":["Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs"],"prefix":"10.1007","volume":"54","author":[{"given":"Jorge M. S.","family":"Valente","sequence":"first","affiliation":[]},{"given":"Maria R. A.","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Alok","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Rui A. F. S.","family":"Alves","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,5]]},"reference":[{"key":"2921_CR1","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1111\/j.1540-5915.2002.tb01647.x","volume":"33","author":"BJ Wagner","year":"2002","unstructured":"Wagner BJ, Davis DJ, Kher H (2002) The production of several items in a single facility with linearly changing demand rates. Decis Sci 33:317\u2013346","journal-title":"Decis Sci"},{"key":"2921_CR2","volume-title":"Introduction to quality engineering","author":"G Taguchi","year":"1986","unstructured":"Taguchi G (1986) Introduction to quality engineering. Asian Productivity Organization, Tokyo"},{"key":"2921_CR3","first-page":"113","volume":"31","author":"X Sun","year":"1999","unstructured":"Sun X, Noble JS, Klein CM (1999) Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Trans 31:113\u2013124","journal-title":"IIE Trans"},{"key":"2921_CR4","unstructured":"Korman K (1994) A pressing matter. Video, pp 46\u201350"},{"key":"2921_CR5","unstructured":"Landis K (1993) Group technology and cellular manufacturing in the Westvaco Los Angeles VH Department. Project report in IOM 581, School of Business, University of Southern California, California"},{"key":"2921_CR6","unstructured":"Valente JMS (2007) An exact approach for single machine scheduling with quadratic earliness and tardiness penalties. Working Paper 238, Faculdade de Economia, Universidade do Porto, Portugal"},{"key":"2921_CR7","doi-asserted-by":"crossref","first-page":"3696","DOI":"10.1016\/j.cor.2007.04.006","volume":"35","author":"JMS Valente","year":"2008","unstructured":"Valente JMS, Alves RAFS (2008) Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Comput Oper Res 35:3696\u20133713","journal-title":"Comput Oper Res"},{"key":"2921_CR8","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1057\/jors.2008.191","volume":"61","author":"JMS Valente","year":"2010","unstructured":"Valente JMS (2010) Beam search heuristics for quadratic earliness and tardiness scheduling. J Oper Res Soc 61:620\u2013631","journal-title":"J Oper Res Soc"},{"key":"2921_CR9","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1007\/s00170-008-1906-6","volume":"44","author":"JMS Valente","year":"2009","unstructured":"Valente JMS, Moreira MRA (2009) Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Int J Adv Manuf Technol 44:995\u20131009","journal-title":"Int J Adv Manuf Technol"},{"key":"2921_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1057\/jors.1988.26","volume":"39","author":"T Abdul-Razaq","year":"1988","unstructured":"Abdul-Razaq T, Potts CN (1988) Dynamic programming state-space relaxation for single machine scheduling. J Oper Res Soc 39:141\u2013152","journal-title":"J Oper Res Soc"},{"key":"2921_CR11","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/S0377-2217(96)00062-8","volume":"96","author":"G Li","year":"1997","unstructured":"Li G (1997) Single machine earliness and tardiness scheduling. Eur J Oper Res 96:546\u2013558","journal-title":"Eur J Oper Res"},{"key":"2921_CR12","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1016\/S0305-0548(98)00081-1","volume":"26","author":"CF Liaw","year":"1999","unstructured":"Liaw CF (1999) A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Comput Oper Res 26:679\u2013693","journal-title":"Comput Oper Res"},{"key":"2921_CR13","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1057\/palgrave.jors.2601865","volume":"56","author":"JMS Valente","year":"2005","unstructured":"Valente JMS, Alves RAFS (2005) Improved lower bounds for the early\/tardy scheduling problem with no idle time. J Oper Res Soc 56:604\u2013612","journal-title":"J Oper Res Soc"},{"key":"2921_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/mnsc.35.2.177","volume":"35","author":"PS Ow","year":"1989","unstructured":"Ow PS, Morton TE (1989) The single machine early\/tardy problem. Manag Sci 35:177\u2013191","journal-title":"Manag Sci"},{"key":"2921_CR15","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/j.cor.2003.08.003","volume":"32","author":"JMS Valente","year":"2005","unstructured":"Valente JMS, Alves RAFS (2005) Improved heuristics for the early\/tardy scheduling problem with no idle time. Comput Oper Res 32:557\u2013569","journal-title":"Comput Oper Res"},{"key":"2921_CR16","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/j.cie.2005.01.020","volume":"48","author":"JMS Valente","year":"2005","unstructured":"Valente JMS, Alves RAFS (2005) Filtered and recovering beam search algorithms for the early\/tardy scheduling problem with no idle time. Comput Ind Eng 48:363\u2013375","journal-title":"Comput Ind Eng"},{"key":"2921_CR17","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0167-188X(83)90012-5","volume":"7","author":"SK Gupta","year":"1983","unstructured":"Gupta SK, Sen T (1983) Minimizing a quadratic function of job lateness on a single machine. Eng Costs Prod Econ 7:187\u2013194","journal-title":"Eng Costs Prod Econ"},{"key":"2921_CR18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0925-5273(95)00201-4","volume":"42","author":"T Sen","year":"1995","unstructured":"Sen T, Dileepan P, Lind MR (1995) Minimizing a weighted quadratic function of job lateness in the single machine system. Int J Prod Econ 42:237\u2013243","journal-title":"Int J Prod Econ"},{"key":"2921_CR19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0925-5273(98)00041-3","volume":"55","author":"LH Su","year":"1998","unstructured":"Su LH, Chang PC (1998) A heuristic to minimize a quadratic function of job lateness on a single machine. Int J Prod Econ 55:169\u2013175","journal-title":"Int J Prod Econ"},{"key":"2921_CR20","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/S0377-2217(01)00322-8","volume":"143","author":"J Schaller","year":"2002","unstructured":"Schaller J (2002) Minimizing the sum of squares lateness on a single machine. Eur J Oper Res 143:64\u201379","journal-title":"Eur J Oper Res"},{"key":"2921_CR21","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"},{"key":"2921_CR22","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H Hoogeveen","year":"2005","unstructured":"Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167:592\u2013623","journal-title":"Eur J Oper Res"},{"key":"2921_CR23","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.48.1.99.12447","volume":"48","author":"JJ Kanet","year":"2000","unstructured":"Kanet JJ, Sridharan V (2000) Scheduling with inserted idle time: problem taxonomy and literature review. Oper Res 48:99\u2013110","journal-title":"Oper Res"},{"key":"2921_CR24","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, Re-issued in 1992 by MIT Press"},{"key":"2921_CR25","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading"},{"key":"2921_CR26","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/ijoc.9.3.231","volume":"9","author":"CR Reeves","year":"1997","unstructured":"Reeves CR (1997) Genetic algorithms for the operations researcher. INFORMS J Comput 9:231\u2013250","journal-title":"INFORMS J Comput"},{"key":"2921_CR27","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/0-306-48056-5_3","volume-title":"Handbook of metaheuristics","author":"C Reeves","year":"2003","unstructured":"Reeves C (2003) Genetic algorithms. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Dordrecht, pp 55\u201382"},{"key":"2921_CR28","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetics and random keys for sequencing and optimization. ORSA J Comput 6:154\u2013160","journal-title":"ORSA J Comput"},{"key":"2921_CR29","doi-asserted-by":"crossref","first-page":"2707","DOI":"10.1016\/j.cor.2008.11.016","volume":"36","author":"JMS Valente","year":"2009","unstructured":"Valente JMS, Gon\u00e7alves JF (2009) A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. Comput Oper Res 36:2707\u20132715","journal-title":"Comput Oper Res"},{"key":"2921_CR30","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1016\/j.ejor.2005.11.062","volume":"183","author":"JF Gon\u00e7alves","year":"2007","unstructured":"Gon\u00e7alves JF (2007) A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. Eur J Oper Res 183:1212\u20131229","journal-title":"Eur J Oper Res"},{"key":"2921_CR31","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"JF Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves JF, Mendes JJM, Resende MGC (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res 167:77\u201395","journal-title":"Eur J Oper Res"},{"key":"2921_CR32","first-page":"230","volume-title":"Proceedings of the fourth international conference on genetic algorithms","author":"WM Spears","year":"1991","unstructured":"Spears WM, De Jong KA (1991) On the virtues of parameterized uniform crossover. In: Belew R, Booker L (eds) Proceedings of the fourth international conference on genetic algorithms. Morgan Kaufman, San Mateo, pp 230\u2013236"},{"key":"2921_CR33","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22:5\u201313","journal-title":"Comput Oper Res"},{"key":"2921_CR34","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/ijoc.9.3.251","volume":"9","author":"RK Ahuja","year":"1997","unstructured":"Ahuja RK, Orlin JB (1997) Developing fitter GAs. INFORMS J Comput 9:251\u2013253","journal-title":"INFORMS J Comput"},{"key":"2921_CR35","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","volume":"27","author":"RK Ahuja","year":"2000","unstructured":"Ahuja RK, Orlin JB, Tiwari A (2000) A greedy genetic algorithm for the quadratic assignment problem. Comput Oper Res 27:917\u2013934","journal-title":"Comput Oper Res"},{"key":"2921_CR36","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1023\/A:1009665726946","volume":"6","author":"KJC Armony","year":"2000","unstructured":"Armony KJC, Luss H, Rosenwein MB (2000) Design of stacked self-healing rings using a genetic algorithm. J Heuristics 6:85\u2013105","journal-title":"J Heuristics"},{"key":"2921_CR37","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/0-306-48056-5_5","volume-title":"Handbook of metaheuristics","author":"P Moscato","year":"2003","unstructured":"Moscato P, Cotta C (2003) A gentle introduction to memetic algotihms. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Dordrecht, pp 105\u2013144"}],"container-title":["The International Journal of Advanced Manufacturing Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00170-010-2921-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00170-010-2921-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00170-010-2921-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T14:09:22Z","timestamp":1558620562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00170-010-2921-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,5]]},"references-count":37,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["2921"],"URL":"https:\/\/doi.org\/10.1007\/s00170-010-2921-y","relation":{},"ISSN":["0268-3768","1433-3015"],"issn-type":[{"value":"0268-3768","type":"print"},{"value":"1433-3015","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,5]]}}}