MICAI 2007: MICAI 2007: Advances in Artificial Intelligence pp 1099-1109 | Cite as
Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-Wait Flowshop Scheduling
Conference paper
Abstract
This research presents a novel approach to solve m-machine no-wait flowshop scheduling problem. A continuous flowshop problem with total flowtime as criterion is considered applying a hybrid evolutionary algorithm. The performance of the proposed method is evaluated and the results are compared with the best known in the literature. Experimental tests show the superiority of the evolutionary hybrid regarding the solution quality.
Keywords
Schedule Problem Cluster Center Total Completion Time Local Search Procedure Discrete Particle Swarm Optimization
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44, 510–525 (1996)MATHMathSciNetCrossRefGoogle Scholar
- 2.Adiri, I., Pohoryles, D.: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics Quarterly 29, 495–504 (1982)MATHCrossRefMathSciNetGoogle Scholar
- 3.Rajendran, C., Chaudhuri, D.: Heuristic algorithms for continuous flow-shop problem. Naval Research Logistics 37, 695–705 (1990)MATHCrossRefGoogle Scholar
- 4.Van der Veen, J.A.A., Van Dal, R.: Solvable cases of the no-wait flowshop scheduling problem. Journal of the Operational Research Society 42, 971–980 (1991)MATHCrossRefGoogle Scholar
- 5.Chen, C.L., Neppalli, R.V., Aljaber, N.: Genetic algorithms applied to the continuous flow shop problem. Computers and Industrial Engineering 30, 919–929 (1996)CrossRefGoogle Scholar
- 6.Aldowaisan, T., Allahverdi, A.: Total flowtime in no-wait flowshops with separated setup times. Computers and Operations Research 25, 757–765 (1998)MATHCrossRefGoogle Scholar
- 7.Aldowaisan, T.: A new heuristic and dominance relations for no-wait flowshops with setups. Computers and Operations Research 28, 563–584 (2000)CrossRefGoogle Scholar
- 8.Allahverdi, A., Aldowaisan, T.: No-wait and separate setup three-machine flowshop with total completion time criterion. International Transactions in Operational Research 7, 245–264 (2000)CrossRefMathSciNetGoogle Scholar
- 9.Aldowaisan, T., Allahverdi, A.: New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega 32(5), 345–352 (2004)CrossRefGoogle Scholar
- 10.Aldowaisan, T., Allahverdi, A.: New heuristics for no-wait flowshops to minimize makespan. Computers and Operations Research 30(8), 1219–1231 (2003)MATHCrossRefGoogle Scholar
- 11.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)CrossRefGoogle Scholar
- 12.Fink, A., Voβ, S.: Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research 151, 400–414 (2003)MATHCrossRefMathSciNetGoogle Scholar
- 13.Fink, A., Voβ, S.: HotFrame: a heuristic optimization framework. In: Voß, S., Woodruff, D. (eds.) Optimization software class libraries, pp. 81–154. Kluwer, Boston (2002)Google Scholar
- 14.Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)MATHCrossRefGoogle Scholar
- 15.Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers and Operations Research (2007), doi: 10.1016/j.cor.2006.12.030Google Scholar
- 16.Carlier, J.: Ordonnancements a contraintes disjonctives. RAIRO Recherche operationelle 12, 333–351 (1978)MATHMathSciNetGoogle Scholar
- 17.Heller, J.: Some numerical experiments for an MxJ flow shop and its decision-theoretical aspects. Operations Research 8, 178–184 (1960)MATHMathSciNetGoogle Scholar
- 18.Reeves, C.: A genetic algorithm for flowshop sequencing. Computers and Operations Research 22, 5–13 (1995)MATHCrossRefGoogle Scholar
- 19.Rajendran, C.: A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society 45, 472–479 (1994)MATHCrossRefGoogle Scholar
- 20.Syswerda, G.: Uniform crossover in genetic algorithms. In: International Conference on Genetic Algorithms (ICGA), Virginia, USA, pp. 2–9 (1989)Google Scholar
- 21.Cotta, C., Troya, J.M.: Genetic Forma Recombination in Permutation Flowshop Problems. Evolutionary Computation 6, 25–44 (1998)Google Scholar
- 22.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)Google Scholar
- 23.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. Springer SCI Series, vol. 75, pp. 81–102 (2007)Google Scholar
- 24.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)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2007