A hybrid permutation-coded evolutionary algorithm for the early/tardy scheduling problem

Asia-Pacific Journal of Operational Research

Volumn 27, Issue 6, 2010, Pages 713-725

  Singh, Alok ^a  

^a UNIVERSITY OF HYDERABAD   (India)

Author keywords

early tardy; heuristics; Scheduling; single machine; steady state genetic algorithms; uniform order based crossover

Indexed keywords

EARLY/TARDY; HEURISTICS; SINGLE MACHINES; STEADY-STATE GENETIC ALGORITHMS; UNIFORM ORDER-BASED CROSSOVER;

GENETIC ALGORITHMS;

EID: 78650661928     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021759591000296X     Document Type: Article

References (18)

1. Abdul-Razaq, TS and CN Potts (1988). Dynamic programming state-space relaxation for single-machine scheduling. Journal of the Operational Research Society, 39, 141-142.
2. Bean, JC (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6, 154-160.
3. Beasley, JE and PC Chu (1996). A genetic algorithm for the set covering problem. European Journal of Operational Research, 94, 394-404.
4. Davis, L (1991). Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold. Goldberg, DE and K Deb (1991). A comparative analysis of selection schemes used in genetic algorithms. In Proceedings of the 1991 Conference on Foundations of Genetic Algorithms, pp. 69-93.
5. Hoogeveen, H (2005). Multicriteria scheduling. European Journal of Operational Research, 167, 592-623.
6. Kanet, JJ and V Sridharan (2000). Scheduling with inserted idle time: problem taxonomy and literature review. Operations Research, 48, 99-110.
7. Korman, K (1994). A pressing matter. Video, February, pp. 46-50.
8. 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.
9. Lenstra, JK, AHG Rinooy Kan and P Brucker (1997). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343-362.
10. Li, G (1977). Single machine earliness and tardiness scheduling. European Journal of Operational Research, 96, 546-558.
11. Liaw, CF (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Computers & Operations Research, 26, 679-693.
12. Ow, PS and T Morton (1989). The single machine early-tardy problem. Management Science, 35, 177-191.
13. Singh, A and AK Gupta (2007). Improved heuristics for the bounded-diameter minimum spanning tree problem. Soft Computing, 11, 911-921.
14. Spears, WM and KA DeJong (1991). On the virtues of parameterized uniform crossover. In Proceedings of the 4th International Conference on Genetic Algorithms, pp. 230-236.
15. Tanaka, S (2007). An exact algorithm for single-machine scheduling without idle time. In Proceedings of the 3rd Multidisciplinary International Scheduling Conference (MISTA 2007), pp. 614-617.
16. Valente, JMS and RAFS Alves (2005a). Improved heuristics for the early/tardy scheduling problem with no idle time. Computers & Operations Research, 32, 557-569.
17. Valente, JMS and RAFS Alves (2005b). Improved lower bounds for the early/tardy scheduling problem with no idle time. Journal of the Operational Research Society, 56, 604-612.
18. Valente, JMS, JF Gonçalves and RAFS Alves (2006). A hybrid genetic algorithm for the early/tardy scheduling problem. Asia-Pacific Journal of Operational Research, 23, 393-405.