Improved solutions for job shop scheduling problems through genetic algorithm with a different method of schedule deduction

International Journal of Advanced Manufacturing Technology

Volumn 28, Issue 5-6, 2006, Pages 532-540

  Amirthagadeswaran, K S ^a   Arunachalam, V P ^a  

^a GOVERNMENT COLLEGE OF TECHNOLOGY   (India)

Author keywords

Edge recombination operator; Genetic algorithm; Job shop scheduling; Schedule deduction

Indexed keywords

BENCHMARKING; COMBINATORIAL MATHEMATICS; COMPUTER PROGRAM LISTINGS; GENETIC ALGORITHMS; PROBLEM SOLVING;

BENCHMARK PROBLEMS; EDGE RECOMBINATION OPERATOR; JOB SHOP SCHEDULING; SCHEDULE DEDUCTION;

SCHEDULING;

EID: 33645503297     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-004-2403-1     Document Type: Article

References (9)

1. Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New York
2. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
3. Pinedo M, Chao X (1999) Operation scheduling with applications in manufacturing and services. McGraw-Hill, Boston
4. Goldberg DE (1989) Genetic algorithm in search, optimization, and machine learning. Addison-Wesley, Boston
5. Cheng R (1996) A tutorial survey of job-shop scheduling problems using genetic algorithm I: representation. J Comput Ind Eng 30(4):983-987
6. Panneerselvamn E (2001) Production and operations management. Prentice-Hall, New Delhi
7. Filho JLR, Treleaven PC (1994) Genetic algorithm programming environments. IEEE Comput 27(6):28-43
8. Beasley JE (1990) OR-Library. http://mscmga.ms.ic.ac.uk/info.html. Cited 1 July 2004
9. Ponnambalam SG, Aravindan P, Sreenivasa Rao P (2001) Comparative evaluation of genetic algorithms for job shop scheduling. Prod Plan Control 12(6):560-574