Abstract
In this paper we present three hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. Our heuristic is a combination of a steady-state genetic algorithm and three improvement procedures. The two computationally less expensive of these three improvement procedures are used inside the genetic algorithm to improve the schedule obtained after the application of genetic operators, whereas the more expensive one is used to improve the best solution returned by the genetic algorithm. We have compared our hybrid approaches against existing recovering beam search and genetic algorithms. The computational results show the effectiveness of our hybrid approaches. Indeed, our hybrid approaches outperformed the existing heuristics in terms of solution quality as well as running time.


Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Abdul-Razaq TS, Potts CN (1988) Dynamic programming state-space relaxation for single-machine scheduling. J Oper Res Soc 39:141–142
Bagchi U, Chang Y, Sullivan R (1987) Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date. Nav Res Logist 34:739–751
Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38:22–36
Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154–160
Beasley JE, Chu PC (1996) A genetic algorithm for the set covering problem. Eur J Oper Res 94:394–404
Cheng TCE (1984) Optimal due date determination and sequencing of n jobs on a single machine. J Oper Res Soc 35:433–437
Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New York
Gupta SK, Sen T (1983) Minimizing a quadratic function of job lateness on a single machine. Eng Costs Prod Econ 7:181–194
Korman K (1994) A pressing matter. Video, pp 46–50
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
Li G (1997) Single machine earliness and tardiness scheduling. Eur J Oper Res 96:546–558
Liaw CF (1999) A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Comput Oper Res 26:679–693
Valente JMS (2007) An exact approach for single machine scheduling problem with quadratic earliness and tardiness penalties. Working Paper 238, Faculdade de Economia, Universidade do Porto, Portugal
Valente JMS, Alves RAFS (2008) Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Comput Oper Res 35:3696–3713
Valente JMS (2010) Beam search heuristics for quadratic earliness and tardiness scheduling. J Oper Res Soc 61:620–631
Valente JMS, Moreira MRA, Singh A, Alves RAFS (2011) Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs. Int J Adv Manuf Technol 54:251–265
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–346
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Singh, A., Valente, J.M.S. & Moreira, M.R.A. Hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs. Int. J. Mach. Learn. & Cyber. 3, 327–333 (2012). https://doi.org/10.1007/s13042-011-0067-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13042-011-0067-3