Abstract
Flexible Job shop Scheduling Problem (FJSP) is a very important problem in the modern manufacturing system. It is an extension of the classical job shop scheduling problem. It allows an operation to be processed by any machine from a given set. It is also an NP-hard problem. This chapter proposes a Multi-Swarm Collaborative Evolutionary Algorithm (MSCEA) to solve FJSP. Experimental studies have been used to test the approach, and the comparisons have been made between this approach and some previous approaches to indicate the adaptability and superiority of the proposed approach. The experimental results show that the proposed approach is a promising and very effective method for the research of FJSP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chen H, Ihlow J, Lehmann C (1999) A genetic algorithm for flexible job-shop scheduling. In: IEEE international conference on robotics and automation, vol 2, pp 1120–1125
Graey MR, Jonmson DS, Sethi R (1976) The complexity of flow shop and job-shop scheduling. Math Oper Res 1:117–129
Brucker P, Schile R (1990) Job-shop scheduling with multi-purpose machines. Computing 45(4):369–375
Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job shop scheduling problem. Comput Oper Res 35:3202–3212
Mastrolilli M, Gambardella LM (2000) Effective neighbourhood functions for the flexible job shop problem. J Sched 3:3–20
Mehrabad MS, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32:563–570
Amiri M, Zandieh M, Yazdani M, Bagheri A (2010) A variable neighbourhoodsearch algorithm for the flexible job shop scheduling problem. Int J Prod Res 8(19):5671–5689
Yazdani M, Amiri M, Zandieh M (2010) Flexible job shop scheduling with parallel variable neighborhood search algorithm. Expert Syst Appl 37:678–687
Li JQ, Pan QK, Suganthan PN, Chua TJ (2010) A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int J Adv Manuf Technol
Ho NB, Tay JC, Lai EMK (2007) An effective architecture for learning and evolving flexible job shop schedules, vol 179, pp 316–333
Bozejko W, Uchronski M, Wodecki M (2010) Parallel hybrid metaheuristics for the flexible job shop problem. Comput Ind Eng 59:323–333
Gao L, Peng CY, Zhou C, Li PG (2006) Solving flexible job shop scheduling problem using general particle swarm optimization. In: The 36th CIE conference on computers and industrial engineering, pp 3018–3027
Fattahi P, Mehrabad MS, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18:331–342
Brandimarte P (1993) Routing and scheduling in a flexible job shop by taboo search. Ann Oper Res 41(3):157–183
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer-Verlag GmbH Germany, part of Springer Nature and Science Press, Beijing
About this chapter
Cite this chapter
Li, X., Gao, L. (2020). An Effective Collaborative Evolutionary Algorithm for FJSP. In: Effective Methods for Integrated Process Planning and Scheduling. Engineering Applications of Computational Methods, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55305-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-55305-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-55303-9
Online ISBN: 978-3-662-55305-3
eBook Packages: EngineeringEngineering (R0)