Abstract
A multi-objective evolutionary search algorithm using a travelling salesman algorithm and genetic algorithm for flow-shop scheduling is proposed in this paper. The initial sequence is obtained by solving the TSP. The initial population of the genetic algorithm is created with the help of a neighbourhood creation scheme known as a random insertion perturbation scheme, which uses the sequence obtained from TSP. The proposed algorithm uses a weighted sum of multiple objectives as a fitness function. The weights are randomly generated for each generation to enable a multi-directional search. The performance measures considered include minimising makespan, mean flow time and machine idle time. The performance of the proposed algorithm is demonstrated by applying it to benchmark problems available in the OR-Library.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York
Pinedo M (1995) Scheduling: theory, algorithms, and systems. Prentice Hall, New Jersey
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
Dipak Leha MIIE, Mukerjee SP (1998) Flow-shop scheduling using genetic algorithms for minimizing makespan. Indian Inst Ind Eng J 27:4–8
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
Dudek RA, Panwalkar SS, Smith ML (1992) The lessons of flow-shop scheduling research. Oper Res 40:7–13
Widmer M, Hertz A (1989) A new heuristic method for the flow shop sequencing problem. Euro J Oper Res 41:186–193
Chen C-L, Neppalli RV, Aljaber N (1996) Genetic algorithms applied to the continuous flow shop problem. Comput Ind Eng 30:919–929
Murata T, Ishibuchi H, Tanaka H (1996) Algorithms for flow-shop scheduling problems. Comput Ind Eng 30:1061–1701
Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278–285
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
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
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
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
Mulkens H (1994) Revisiting the Johnson algorithm for flow-shop scheduling with genetic algorithms. IFIP Trans B: Comput App Tech 15:69–80
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
Zegordi SH, Itoh K, EnkawaT (1995) Minimizing makespan for flow-shop scheduling by combining simulated annealing with sequencing knowledge. Eur J Oper Res 85:515–531
Wen, Pyng U, Yeh, Ching I (1997) Tabu search methods for the flow shop sequencing problem. J Chinese Inst Eng Trans 20:465–470
Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47:65–74
Ponnambalam SG, Aravindan P, Chandrasekaran S (2001) Constructive and improvement flow-shop scheduling heuristics: an extensive evaluation. Prod Plan Contr 12(4):335–344
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ponnambalam, S.G., Jagannathan, H., Kataria, M. et al. A TSP-GA multi-objective algorithm for flow-shop scheduling. Int J Adv Manuf Technol 23, 909–915 (2004). https://doi.org/10.1007/s00170-003-1731-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-003-1731-x