A hybrid genetic algorithm for the early/tardy scheduling problem

Asia-Pacific Journal of Operational Research

Volumn 23, Issue 3, 2006, Pages 393-405

  Valente, Jorge M S ^a   Gonçalves, José Fernando ^a   Alves, Rui A F S ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Early tardy; Genetic algorithms; Heuristics; Random keys; Scheduling

Indexed keywords

CHROMOSOMES; COMPUTATIONAL METHODS; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; RANDOM PROCESSES;

CHROMOSOME REPRESENTATION; COMPUTATIONAL TIMES; DISPATCH RULES; LOCAL SEARCH PROCEDURE;

SCHEDULING;

EID: 33749009581     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595906000978     Document Type: Article

References (17)

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-152.
2. Ahuja, RK, JB Orlin and A Tiwari (2000). A greedy genetic algorithm for the quadratic assignment problem. Computers & Operations Research, 27, 917-934.
3. Bailey, RN, KM Garner and MF Hobbs (1997). Using simulated annealing and genetic algorithms to solve staff scheduling problems. Asia-Pacific Journal of Operational Research, 14, 27-43.
4. Baker, KR and GD Scudder (1990), Sequencing with earliness and tardiness penalties: A review. Operations Research, 38, 22-57.
5. Bean, JC (1994), Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6, 154-160.
6. Goldberg, DE (1989), Genetic Algorithms in Search Optimization and Machine Learning. MA: Addison-Wesley, Reading.
7. Jaramillo, JH, J Bhadury and R Batta (2002). On the use of genetic algorithms to solve location problems. Computers & Operations Research, 29, 761-779.
8. Korman, K (1994). A Pressing Matter, Video, February, pp. 46-50.
9. 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.
10. Lenstra, JK, AHG Rinnooy Kan and P Brucker (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343-362.
11. Li, G (1997). Single machine earliness and tardiness scheduling. European Journal of Operational Research, 96, 546-558.
12. Liaw, CF (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Computers & Operations Research, 26, 679-693.
13. Ow, PS and T Morton (1989). The single machine early-tardy problem. Management Science, 35, 177-191.
14. Spears, WM and KA DeJong (1991). On the virtues of parameterized uniform crossover. In Proc. 4th Int. Conf. Genetic Algorithms, pp. 230-236.
15. Tan, KC, LH Lee and K Ou (2001). Hybrid genetic algorithms in solving vehicle routing problems with time window constraints. Asia-Pacific Journal of Operational Research, 18, 121-130.
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.