Abstract
In this paper we present an evolutionary algorithm (EA) for the no-wait flow shop scheduling problem. This is a new island model with special master-slave structure. In all islands runs a hybrid steady-state algorithm that uses truncation selection, uses only mutation for the generation of the descendants and it improves the solutions with two local search procedures. The mutation is based on the new, modified version of ”the EVL method”, that is a memory based method. The algorithm was tested on benchmark problems; its results are similar to or better than the results of the particle swarm optimization algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aldowaisan, T., Allahverdi, A.: New Heuristics for No-wait Flowshops to Minimize Makespan. Comput. Oper. Res. 30, 1219–1231 (2003)
Borgulya, I.: An Algorithm for the Capacitated Vehicle Routing Problem with Route Balancing. Central European Journal of Operations Research 16(4), 331–344 (2008)
van Deman, J.M., Baker, K.R.: Minimisation mean flow time in flowshop with no intermediate queues. AIIE Trans. 6, 28–34 (1974)
Filho, G.R., Nagano, M.S., Lorena, L.A.N.: Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-wait Flowshop Scheduling. In: Gelbukh, A., Morales, A.F.K. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 1099–1109. Springer, Heidelberg (2007)
Gangadharan, R., Rajendran, C.: Heuristic Algorithms for Scheduling in the Nowait Flow-shop. Int. J. Prod. Econ. 32, 285–290 (1993)
Grabowski, J., Pempera, J.: Some local search algorithms for no-wait flow-scop problem with makespan criterion. Comput. Oper. Res. 32, 2197–2212 (2005)
Liu, B., Ling, W., Jin, Y.-H.: An effective hybrid particle swarm optimization for no-wait flow shop scheduling. Int. J. Adv. Manuf. Technol. 31, 1001–1011 (2007)
Lin, B.M.T., Cheng, T.C.E.: Batch Scheduling in the No-wait Two-machine Flowshop to Minimize the Makespan. Comput. Oper. Res. 28, 613–624 (2001)
Marin, F.J., Trelles-Salazaro, O., Sandoval, F.: Genetic algorithms on LAN-message passing architectures using PVM: Application to the routing problem. In: Davidor, Y., Schwefl, H.P., Männer, R. (eds.) Parallel Problem Solving fron Nature, PPSN III, pp. 534–543. Springer, Berlin (1994)
Nawaz, M., Enscore, E., Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA The International Journal of Management Sciences 11, 91–95 (1983)
Pan, Q.-K., Tasgetiren, M.F., Liang, Y.-C.: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & Operations Research 35, 2807–2839 (2008)
Rajendran, C.: A No-wait Flowshop Scheduling Heuristic to Minimize Makespan. J. Oper. Res. Soc. 45, 472–478 (1994)
Schuster, C.J., Framinan, J.M.: Approximative procedures for no-wait job shop scheduling. Oper. Res. Lett. 31(3), 308–318 (2003)
Shyu, S.J., Lin, B.M.T., Yin, P.-Y.: Application of ant colonyc optimization for no-wait flowshop scheduling problem to minimize the total completion time. Comput. Ind. Eng. 47, 181–193 (2004)
Wang, L., Zheng, D.: An effective hybrid optimization strategy for job-shop scheduling problems. Comput. Oper. Res. 28(6), 585–596 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borgulya, I. (2010). An Island Model for the No-Wait Flow Shop Scheduling Problem. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds) Parallel Problem Solving from Nature, PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15871-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-15871-1_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15870-4
Online ISBN: 978-3-642-15871-1
eBook Packages: Computer ScienceComputer Science (R0)