A TSP-GA multi-objective algorithm for flow-shop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 23, Issue 11-12, 2004, Pages 909-915

  Ponnambalam, S G ^a   Jagannathan, H ^b   Kataria, M ^b   Gadicherla, A ^b  

^a MONASH UNIVERSITY MALAYSIA   (Malaysia)

^b NATIONAL INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Flow shop scheduling; Multi objective genetic algorithm

Indexed keywords

BENCHMARKING; GENETIC ALGORITHMS; HEURISTIC METHODS; PERTURBATION TECHNIQUES; PROBABILITY; TRAVELING SALESMAN PROBLEM;

FLOW-SHOP SCHEDULING; MAKESPAN TIME; MULTI-OBJECTIVE GENETIC ALGORITHMS;

OPERATIONS RESEARCH;

EID: 3142526747     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-003-1731-x     Document Type: Article

References (21)

1. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
2. Pinedo M (1995) Scheduling: theory, algorithms, and systems. Prentice Hall, New Jersey
3. Rajendran C, Zeigler H (1997) Heuristics for scheduling in a flow shop with set-up, processing and removal times separated. Product Plan Contr 8:568-576
4. Dipak Leha MIIE, Mukerjee SP (1998) Flow-shop scheduling using genetic algorithms for minimizing makespan. Indian Inst Ind Eng J 27:4-8
5. Chen C-L, Vempati VS, Aljaber N (1995) Theory and methodology - an application of genetic algorithms for flow shop problems. Eur J Oper Res 80:389-396, 1995
6. Dudek RA, Panwalkar SS, Smith ML (1992) The lessons of flow-shop scheduling research. Oper Res 40:7-13
7. Widmer M, Hertz A (1989) A new heuristic method for the flow shop sequencing problem. Euro J Oper Res 41:186-193
8. Chen C-L, Neppalli RV, Aljaber N (1996) Genetic algorithms applied to the continuous flow shop problem. Comput Ind Eng 30:919-929
9. Murata T, Ishibuchi H, Tanaka H (1996) Algorithms for flow-shop scheduling problems. Comput Ind Eng 30:1061-1701
10. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278-285
11. Rajendran C (1994) A heuristic for scheduling on flow shop and flow line based manufacturing cell with multi criteria. Int J Prod Res 32:2541-2558
12. Santos DL, Hunsucker JL, Deal DE (1996) An evaluation of sequencing heuristics in flow shops with multiple processors. Comput Ind Eng 30(4):681-692
13. Sharada Priyadarshini B, Rajendran C (1996) Formulation and heuristics for scheduling in a buffer constrained flow shop and flow line based manufacturing cell with different buffer space requirements for jobs: part 1. Int J Prod Res 34:3465-3483
14. Fischera S, Grasso V, Lombardo A, Lo Valvo A, Lo Valvo E (1995) Genetic algorithms efficiency in flow-shop scheduling. In: Applications of Artificial Intelligence in Engineering, pp 261-270
15. Mulkens H (1994) Revisiting the Johnson algorithm for flowshop scheduling with genetic algorithms. IFIP Trans B: Comput App Tech 15:69-80
16. Lee K, Yamakawa, Takeshi L, Keon-Myung (1998) Genetic algorithm for general machine scheduling problems. In: proceedings of international conference on knowledge-based intelligent electronic systems 2, pp 60-66
17. Zegordi SH, Itoh K, Enkawa T (1995) Minimizing makespan for flow-shop scheduling by combining simulated annealing with sequencing knowledge. Eur J Oper Res 85:515-531
18. Wen, Pyng U, Yeh, Ching I (1997) Tabu search methods for the flow shop sequencing problem. J Chinese Inst Eng Trans 20:465-470
19. Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47:65-74
20. Ponnambalam SG, Aravindan P, Chandrasekaran S (2001) Constructive and improvement flow-shop scheduling heuristics: an extensive evaluation. Prod Plan Contr 12(4):335-344
21. Parthasarathy S, Rajendran C (1997) An experimental evaluation of heuristics for scheduling in a real life flow shop with sequence-dependent set up time of jobs. Int J Prod Econ 49:255-263