Flowshop scheduling by hybridized GA: Some new results

International Journal of Industrial Engineering : Theory Applications and Practice

Volumn 7, Issue 3, 2000, Pages 213-223

  Jain, Nitin ^a   Bagchi, Tapan P ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b ECOLE DES MINES DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; PROCESS CONTROL; SCHEDULING; STATISTICAL TESTS; STRATEGIC PLANNING;

FLOWSHOP SCHEDULING;

PRODUCTION CONTROL;

EID: 0034275967     PISSN: 10724761     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. Bagchi, Tapan P and Deb, Kalyanmoy (1996). Calibration of GA Parameters: The Design of Experiments Approach, Computer Science and Informatics, Vol.26, No. 3.
2. Bagchi, Tapan P (1999),. Multiobiective Scheduling by Genetic Algorithms, Kluwer Academic Publishers.
3. Baker, K R (1974). Introduction to Sequencing and Scheduling, Wiley.
4. Campbell, H, Dudek, R and Smith M (1970). A Heuristic Algorithm for the n-Job m-Machine Sequencing Problem, Management Science, Vol.16B, 630-637.
5. nd International Conference on the Practice and Theory of Automated Timetabling, University of Toronto, Aug 20-22.
6. Dannenbring, D (1977). An Evaluation of Flowshop Sequencing Heuristics, Management Science, 23, 1174-1182.
7. Davidor, Y (1991). Genetic Algorithms and Robotics, World Scientific.
8. French, S (1982). Sequencing and Scheduling: An Introduction to the Math. of the Job Shop, Wiley.
9. Gen M and Cheng R (1997). Genetic Algorithm and Engineering Design, John Wiley & Sons.
10. Goldberg, D E (1989). GAs in Search, Optimization and Machine Learning, Addison-Wesley.
11. Grefenstette, J (1991). Lamarckian Learning in Multi-agent Environment, in the Proceedings of the Fourth Conference on Genetic Algorithms, Morgan-Kaufmann.
12. Gupta, J (1971). A Functional Heuristic Algorithm for the Flowshop Scheduling Problem, Operations Research Quarterly, Vol.22, 39-47.
13. Ho, J C and Chang, Y L (1991). A New Heuristic for the n-Job m-Machine Flowshop Problem, European Journal of Operational Research, Vol.52, 194-202.
14. Holland, J (1975). Adaptation in Natural and Artificial Systems, University of Michigan Press.
15. Hundal, T S and Rajgopal J (1988). An Extension of Palmer's Heuristic for the Flowshop Scheduling Problem, Int. Journal of Production Research, Vol.26, 1119-1124.
16. Johnson, S (1954). Optimal Two-and Three-Stage Production Schedules with Setup Times Included, Naval Logistics Quarterly, Vol.1, 61-68.
17. Kennedy, S (1993). Five Ways to a Smarter Genetic Algorithm, AI Expert, 35-38.
18. Lenstra, J K, Rinnooy Kan, A H G and Brucker, P (1977). Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics, Vol.1, 343-62.
19. Nawaz, M, Enscore, E and Ham, I (1983). A Heuristic Algorithm for the m-Machine n-Job flowshop Sequencing Problem, Omega, Vol.II, 11-95.
20. Palmer, D (1965). Sequencing Jobs Through a Multi-stage Process in the Minimum Total Time - A Quick Method of Obtaining a Near Optimum, Operations Research Quarterly, Vol.16, 101-107.
21. Pinedo, M (1995). Scheduling Theory, Algorithms and Systems, Prentice-Hall.
22. Smith, John M (1993). Theory of Evolution, Canto, Cambridge University Press.