{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:12:50Z","timestamp":1649131970298},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"9-10","license":[{"start":{"date-parts":[[2009,1,10]],"date-time":"2009-01-10T00:00:00Z","timestamp":1231545600000},"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":[[2009,10]]},"DOI":"10.1007\/s00170-008-1906-6","type":"journal-article","created":{"date-parts":[[2009,1,9]],"date-time":"2009-01-09T08:09:39Z","timestamp":1231488579000},"page":"995-1009","source":"Crossref","is-referenced-by-count":10,"title":["Greedy randomised dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties"],"prefix":"10.1007","volume":"44","author":[{"given":"Jorge M. S.","family":"Valente","sequence":"first","affiliation":[]},{"given":"Maria R. A.","family":"Moreira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,10]]},"reference":[{"key":"1906_CR1","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":"1906_CR2","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. doi: 10.1287\/opre.38.1.22","journal-title":"Oper Res"},{"key":"1906_CR3","unstructured":"Bresina JL (1996) Heuristic-biased stochastic sampling. Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, vol 1. AAAI, CA, pp 271\u2013278"},{"key":"1906_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10732-005-6997-8","volume":"11","author":"VA Cicirello","year":"2005","unstructured":"Cicirello VA, Smith SF (2005) Enhancing stochastic search performance by value-biased randomization of heuristics. J Heuristics 11:5\u201334. doi: 10.1007\/s10732-005-6997-8","journal-title":"J Heuristics"},{"key":"1906_CR5","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. doi: 10.1016\/0167-188X(83)90012-5","journal-title":"Eng Costs Prod Econ"},{"key":"1906_CR6","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. doi: 10.1016\/j.ejor.2004.07.011","journal-title":"Eur J Oper Res"},{"key":"1906_CR7","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. doi: 10.1287\/opre.48.1.99.12447","journal-title":"Oper Res"},{"key":"1906_CR8","unstructured":"Korman K (1994) A pressing matter. Video. February, pp 46\u201350"},{"key":"1906_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6377(93)90019-D","volume":"14","author":"W Kubiak","year":"1993","unstructured":"Kubiak W (1993) Completion time variance minimization on single machine is difficult. Oper Res Lett 14:49\u201359. doi: 10.1016\/0167-6377(93)90019-D","journal-title":"Oper Res Lett"},{"key":"1906_CR10","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"},{"key":"1906_CR11","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343\u2013362. doi: 10.1016\/S0167-5060(08)70743-X","journal-title":"Ann Discret Math"},{"key":"1906_CR12","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. doi: 10.1016\/S0377-2217(96)00062-8","journal-title":"Eur J Oper Res"},{"key":"1906_CR13","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. doi: 10.1016\/S0305-0548(98)00081-1","journal-title":"Comput Oper Res"},{"key":"1906_CR14","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1007\/s00170-006-0693-1","volume":"34","author":"S-W Lin","year":"2007","unstructured":"Lin S-W, Ying K-C (2007) Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. Int J Adv Manuf Technol 34:1183\u20131190. doi: 10.1007\/s00170-006-0693-1","journal-title":"Int J Adv Manuf Technol"},{"key":"1906_CR15","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s00170-002-1466-0","volume":"22","author":"R Maheswaran","year":"2003","unstructured":"Maheswaran R, Ponnambalam SG (2003) An investigation on single machine total weighted tardiness scheduling problems. Int J Adv Manuf Technol 22:243\u2013248. doi: 10.1007\/s00170-002-1466-0","journal-title":"Int J Adv Manuf Technol"},{"key":"1906_CR16","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1007\/s00170-004-2093-8","volume":"26","author":"R Maheswaran","year":"2005","unstructured":"Maheswaran R, Ponnambalam SG (2005) An intensive search evolutionary algorithm for single-machine total-weighted-tardiness scheduling problems. Int J Adv Manuf Technol 26:1150\u20131156. doi: 10.1007\/s00170-004-2093-8","journal-title":"Int J Adv Manuf Technol"},{"key":"1906_CR17","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. Manage Sci 35:177\u2013191. doi: 10.1287\/mnsc.35.2.177","journal-title":"Manage Sci"},{"key":"1906_CR18","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1007\/s00170-005-0102-1","volume":"30","author":"R Panneerselvam","year":"2006","unstructured":"Panneerselvam R (2006) Simple heuristic to minimize total tardiness in a single machine scheduling problem. Int J Adv Manuf Technol 30:722\u2013726. doi: 10.1007\/s00170-005-0102-1","journal-title":"Int J Adv Manuf Technol"},{"key":"1906_CR19","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of metaheuristics","author":"MGC Resende","year":"2003","unstructured":"Resende MGC, Ribeiro CC (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer, Dordrecht, pp 219\u2013249"},{"key":"1906_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. doi: 10.1016\/S0377-2217(01)00322-8","journal-title":"Eur J Oper Res"},{"key":"1906_CR21","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.cie.2004.01.011","volume":"46","author":"J Schaller","year":"2004","unstructured":"Schaller J (2004) Single machine scheduling with early and quadratic tardy penalties. Comput Ind Eng 46:511\u2013532. doi: 10.1016\/j.cie.2004.01.011","journal-title":"Comput Ind Eng"},{"key":"1906_CR22","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. doi: 10.1016\/0925-5273(95)00201-4","journal-title":"Int J Prod Econ"},{"key":"1906_CR23","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. doi: 10.1016\/S0925-5273(98)00041-3","journal-title":"Int J Prod Econ"},{"key":"1906_CR24","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1007\/s00170-005-0261-0","volume":"31","author":"T-I Tsai","year":"2007","unstructured":"Tsai T-I (2007) A genetic algorithm for solving the single machine earliness\/tardiness problem with distinct due dates and ready times. Int J Adv Manuf Technol 31:994\u20131000. doi: 10.1007\/s00170-005-0261-0","journal-title":"Int J Adv Manuf Technol"},{"key":"1906_CR25","unstructured":"Valente JMS (2007a) An exact approach for single machine scheduling with quadratic earliness and tardiness penalties. Working Paper 238. Faculdade de Economia, Universidade do Porto, Portugal"},{"key":"1906_CR26","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1504\/EJIE.2007.015391","volume":"1","author":"JMS Valente","year":"2007","unstructured":"Valente JMS (2007b) Heuristics for the single machine scheduling problem with early and quadratic tardy penalties. Eur J Ind Eng 1:431\u2013448. doi: 10.1504\/EJIE.2007.015391","journal-title":"Eur J Ind Eng"},{"key":"1906_CR27","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1142\/S0217595908001730","volume":"25","author":"JMS Valente","year":"2008","unstructured":"Valente JMS (2008a) An exact approach for the single machine scheduling problem with linear early and quadratic tardy penalties. Asia-Pac J Oper Res 25:169\u2013186. doi: 10.1142\/S0217595908001730","journal-title":"Asia-Pac J Oper Res"},{"key":"1906_CR28","unstructured":"Valente JMS (2008b) Beam search heuristics for quadratic earliness and tardiness scheduling. Working Paper 279. Faculdade de Economia, Universidade do Porto, Portugal (to appear in J Oper Res Soc)"},{"key":"1906_CR29","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 (2005a) Filtered and recovering beam search algorithms for the early\/tardy scheduling problem with no idle time. Comput Ind Eng 48:363\u2013375. doi: 10.1016\/j.cie.2005.01.020","journal-title":"Comput Ind Eng"},{"key":"1906_CR30","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 (2005b) Improved heuristics for the early\/tardy scheduling problem with no idle time. Comput Oper Res 32:557\u2013569. doi: 10.1016\/j.cor.2003.08.003","journal-title":"Comput Oper Res"},{"key":"1906_CR31","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 (2005c) Improved lower bounds for the early\/tardy scheduling problem with no idle time. J Oper Res Soc 56:604\u2013612. doi: 10.1057\/palgrave.jors.2601865","journal-title":"J Oper Res Soc"},{"key":"1906_CR32","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. doi: 10.1016\/j.cor.2007.04.006","journal-title":"Comput Oper Res"},{"key":"1906_CR33","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. doi: 10.1111\/j.1540-5915.2002.tb01647.x","journal-title":"Decis Sci"}],"container-title":["The International Journal of Advanced Manufacturing Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00170-008-1906-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00170-008-1906-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00170-008-1906-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T13:58:49Z","timestamp":1558619929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00170-008-1906-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,10]]},"references-count":33,"journal-issue":{"issue":"9-10","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["1906"],"URL":"https:\/\/doi.org\/10.1007\/s00170-008-1906-6","relation":{},"ISSN":["0268-3768","1433-3015"],"issn-type":[{"value":"0268-3768","type":"print"},{"value":"1433-3015","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,10]]}}}