Improved genetic algorithm for the permutation flowshop scheduling problem

Computers and Operations Research

Volumn 31, Issue 4, 2004, Pages 593-606

  Iyer, Srikanth K ^a   Saxena, Barkha ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b Fair Isaac   (United States)

Author keywords

Design of experiments; Genetic algorithms; Longest common subsequence; Permutation flowshop scheduling

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING; STATISTICAL PROCESS CONTROL;

ASSEMBLY LINE; COMPLEX SEARCH SPACES; PERMUTATION FLOWSHOP;

GENETIC ALGORITHMS;

GENETIC ALGORITHM;

EID: 0346009089     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00016-9     Document Type: Article

References (25)

1. Johnson SM. Optimal two and three stage production schedules with setup times included. Naval Research and Logistics Quarlerly 1954;1:61-8.
2. Holland JH. Adaption in natural and artificial systems. Ann Arbor: The University of Michigan Press, 1975.
3. Goldberg DE. GAs in search, optimization and machine learning. Reading, MA: Addison-Wesley, 1989.
4. Davis L, editor. Handbook of genetic algorithm. New York: Van Nostrand Reinhold, 1991.
5. Jog P et al. The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the travelling salesman problem. Proceedings of the Third IGCA, San Mateo 1989, p. 110-5.
6. Starkweather T et al. A comparison of genetic sequencing operators. Proceedings of Fourth IGCA, 1991, p. 69-76.
7. Ulder NLJ. Genetic local search algorithms for the travelling salesman problem. In: Schwefel HP, Manner R, editors. Parallel problem solving for nature. Berlin: Springer, 1991. p. 109-16.
8. Fox BR, McMahon MB. In: Rawlins GJE, editor. Genetic operations for sequencing problems, foundations of genetic algorithms. San Mateo: Morgan Kaufmann Publishers; 1991, p. 284-300.
9. Ischibuchi H, et al. Genetic algorithms and neighbourhood search algorithms for fuzzy flowshop scheduling problems. Fuzzy Sets and Systems 1994;67:81-100.
10. Osman IH, Potts CN. Simulated annealing for permutation flow-shop scheduling. OMEGA 1989;17:551-7.
11. max flowshop problem. Computers and Operations Research 1989;17:243-53.
12. Reeves CR. Genetic algorithm for flowshop, sequencing. Computers and Operations Research 1995;15:5-23.
13. Taillard E. Some efficient heuristics methods for flow-shop sequencing problem. European Journal of Operations Research 1991;47:65-74.
14. Murata T, et al. Genetic algorithm for flowshop scheduling problems. Computers and Industrial Engineering 1996;30(4):1061-71.
15. Bagchi TP. Multi-objective scheduling by genetic algorithms. Boston: Kluwer Academic Publishers, 1999.
16. Pinedo M. Scheduling theory, algorithms and systems. Englewood Cliffs: Prentice-Hall, 1995.
17. Djerid L, Portmann M-C. How to keep good schemata using crossover operators for the permutation problems. International Transactions in Operations Research 2000;7(6):637-51.
18. Portmann MC, Vignier A. Performance study on crossover operators keeping goes schemata for some scheduling problems. 2002, preprint.
19. Davis L. Job-shop scheduling with genetic algorithms. Proceedings of the First International Conference on Genetic Algorithms and their Applications. Hillsdale: Lawrence Erlbaum. p. 136-40.
20. Falkenauer E, Bouffouix S. A genetic algorithm for job shop. Proceedings of the IEEE International Conference on Robotics and Automation, vol. 1. Sacramento. p. 824-9.
21. Caux C, Pierreval H, Portmann M-C. Les Algorithms Gntiques et leur application aux problems d'ordonnancement. Rairo-APII 1995;29(4-5):409-43.
22. Djerid L, Portmann M-C, Villon P. Performance analysis of permutation crossover genetic operators. Journal of Decision Systems 1996;4(1/2):157-77.
23. Bagchi TP, Deb K. Calibration of GA parameters: the design of experiment approach. Computer Science and Informatics 1996;26(3):46-56.
24. Baker KR. Introduction to sequencing and scheduling. New York: Wiley, 1974.
25. Corman TH, Leiserson CE, Rivest RL. Introduction to algorithms. New York: MIT Press, McGraw-Hill, 1990.