A genetic algorithm based procedure for more realistic job shop scheduling problems

International Journal of Production Research

Volumn 36, Issue 12, 1998, Pages 3437-3457

  Candido, M A B ^a   Khator, S K ^b   Barcia, R M ^c  

^a PONTIFICAL CATHOLIC UNIVERSITY OF PARANÁ   (Brazil)

^b UNIVERSITY OF SOUTH FLORIDA   (United States)

^c FEDERAL UNIVERSITY OF SANTA CATARINA   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

EVALUATION; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING;

SCHEDULE GENERATION ALGORITHMS;

GENETIC ALGORITHMS;

EID: 0032295711     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075498192148     Document Type: Article

References (7)

1. Candido, M. A. B., 1997, A Hybrid Genetic Approach to Solve Real Make-to-Order Job Shop Scheduling Problems. Doctoral dissertation, Federal University of Santa Catarina, Brazil.
2. Dell’ Amico, M. and Trubian, M., 1993, Applying tabu search to the job-shop scheduling problem. Annals of Operations Research, 41, 231-252.
3. Giffler, B. and Thompson, G. L., 1960, Algorithms for solving production-scheduling problems. Operations Research, 8, 487-503.
4. Laarhoven, P. J., Aarts, E. H. L. and Lenstra, J. K., 1992, Job shop scheduling by simulated annealing. Operations Research, 40, 113-125.
5. Mattfeld, D. C., 1996, Evolutionary Search and the Job Shop (Heidelberg, Germany: Physica-Verlag).
6. Park, L. J. and Park, C. H., 1995, Genetic algorithm for job shop scheduling problems based on two representational schemes. Eletronics Letters, 31, 2051-2053.
7. Sun, D., Batta, R. and Lin, L., 1995, Effective job shop scheduling through active chain. Manipulation. Computers in Operations Research, 22, 159-172.