Abstract
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid metaheuristic Genetic Algorithm - Cluster Search is proposed for the scheduling problem solution. The performance of the proposed method is evaluated and results are compared with the best reported in the literature. Experimental tests show the new method superiority for the test problems set, regarding the solution quality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garey, M.R., Johnson, D.S., Sethi, R.: The Complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1, 117–129 (1976)
Rinnooy Kan, A.H.G.: Machine Scheduling Problems: Classification, Complexity, and Computations. Nijhoff, The Hahue (1976)
Ahmadi, R.H., Bagchi, U.: Improved lower bounds for minimizing the sum of completion times of n jobs over m machines. European Journal of Operational Research 44, 331–336 (1990)
Rajendran, C., Chaudhuri, D.: An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research 61, 318–325 (1991)
Rajendran, C.: Heuristic algorithm for scheduling in a flowshop to minimise total flowtime. International Journal Production Economics 29, 65–73 (1993)
Ho, J.C.: Flowshop sequencing with mean flowtime objective. European Journal of Operational Research 81, 571–578 (1995)
Wang, C., Chu, C., Proth, J.M.: Heuristic approaches for n/m/F/ Ci scheduling problems. European Journal of Operational Research 96, 636–644 (1997)
Woo, D.S., Yim, H.S.: A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers and Operations Research 25, 175–182 (1998)
Liu, J., Reeves, C.R.: Constructive and composite heuristic solutions to the P// ∑ C i scheduling problem. European Journal of Operational Research 132, 439–452 (2001)
Allahverdi, A., Aldowaisan, T.: New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics 77, 71–83 (2002)
Framinan, J.M., Leisten, R.: An efficient constructive heuristic for flowtime minimisation in permutation flow shop. OMEGA 31, 311–317 (2003)
Framinan, J.M., Leisten, R., Ruiz-Usano, R.: Comparison of heuristics for flowtime minimisation in permutation flowshops. Computer and Operations Research 32, 1237–1254 (2005)
Li, X., Wang, Q., Wu, C.: Efficient composite heuristics for total flowtime minimization in permutation flow shops. Omega (2006), doi: 10.1016-j.omega.2006.11.003
Nagano, M.S., Moccellin, J.V.: Reducing mean flow time in permutation flow shop. Journal of the Operational Research Society (2007), doi: 10.1057/palgrave.jors.2602395
Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155, 426–438 (2004)
Tasgetiren, M.F., Liang, Y.C., Sevkli, M., Gencyilmaz, G.: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177, 1930–1947 (2007)
Stutzle, T.: Applying iterated local search to the permutation flowshop problem. Technical Report, AIDA-98-04, Darmstad University of Technology, Computer Science Department, Intelletics Group, Darmstad, Germany (1998)
Merkle, D., Middendorf, M.: An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In: Oates, M.J., Lanzi, P.L., Li, Y., Cagnoni, S., Corne, D.W., Fogarty, T.C., Poli, R., Smith, G.D. (eds.) EvoWorkshops 2000. LNCS, vol. 1803, pp. 287–296. Springer, Heidelberg (2000)
Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)
Cotta, C., Fernandez, A.J.: Memetic Algorithms in Planning, Scheduling and Timetabling. Evolutionary Schedulling, pp. 1–30. Springer, Heidelberg (2006)
Kleeman, M.P., Lamont, G.B.: Scheduling of flow-shop, job-shop, and combined scheduling problems using MOEAs with fixed and variable length chromosomes. In: Evolutionary Schedulling, pp. 49–100. Springer, Heidelberg (2006)
Bean, J.C.: Genetic algorithm and random keys for sequencing and optimization. ORSA Journal on Computing 6, 154–160 (1994)
Watson, J.P., Barbulescu, L., Whitley, L.D., Howe, A.E.: Contrasting structured and random permutation flowshop scheduling problems: Search space topology and algorithm performance. ORSA Journal of Computing 14, 98–123 (2002)
Oliveira, A.C.M., Lorena, L.A.N.: Detecting promising areas by evolutionary clustering search. In: Bazzan, A.L.C., Labidi, S. (eds.) Advances in Artificial Intelligence. LNCS (LNAI), pp. 385–394. Springer, Heidelberg (2004)
Oliveira, A.C.M., Lorena, L.A.N.: Hybrid evolutionary algorithms and clustering search. In: Grosan, C., Abraham, A., Ishibuchi, H. (eds.) Hybrid Evolutionary Systems - Studies in Computational Intelligence. SCI Series, vol. 75, pp. 81–102. Springer, Heidelberg (2007)
Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA 11, 91–95 (1983)
Glover, F.: Tabu search and adaptive memory programing: Advances, applications and challenges. In: Interfaces in Computer Science and Operations Research, pp. 1–75. Kluwer Academic Publishers, Dordrecht (1996)
Syswerda, G.: Uniform crossover in genetic algorithms. In: International Conference on Genetic Algorithms (ICGA), Virginia, USA, pp. 2–9 (1989)
Cotta, C., Troya, J.M.: Genetic Forma Recombination in Permutation Flowshop Problems. Evolutionary Computation 6, 25–44 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Filho, G.R., Nagano, M.S., Lorena, L.A.N. (2007). Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop. In: Bartz-Beielstein, T., et al. Hybrid Metaheuristics. HM 2007. Lecture Notes in Computer Science, vol 4771. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75514-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-75514-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75513-5
Online ISBN: 978-3-540-75514-2
eBook Packages: Computer ScienceComputer Science (R0)