Flexible Job-shop Scheduling Problem with Sequence-dependent Setup Times using Genetic Algorithm

Job shop scheduling problems (JSSP) are among the most intensive combinatorial problems studied in literature. The flexible job shop problem (FJSP) is a generalization of the classical JSSP where each operation can be processed by more than one resource. The FJSP problems cover two difficulties, namely, machine assignment problem and operation sequencing problem. This paper investigates the flexible job-shop scheduling problem with sequence-dependent setup times to minimize two kinds of objectives function: makespan and bi-criteria objective function. For that, we propose a genetic algorithm (GA) to solve this problem. To evaluate the performance of our algorithm, we compare our results with other methods existing in literature. All the results show the superiority of our GA against the available ones in terms of solution quality.

[1]  João Pedro Pedroso,et al.  A tabu search for the permutation flow shop problem with sequence dependent setup times , 2014, Int. J. Data Anal. Tech. Strateg..

[2]  Ali Allahverdi,et al.  The third comprehensive survey on scheduling problems with setup times/costs , 2015, Eur. J. Oper. Res..

[3]  Chandrasekharan Rajendran,et al.  An ant colony algorithm for scheduling in flowshops with sequence-dependent setup times of jobs , 2006 .

[4]  Parinya Kaweegitbundit.  Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup Time , 2011 .

[5]  S. C. Kim,et al.  Impact of sequence-dependent setup time on job shop scheduling performance , 1994 .

[6]  Khaled Ghédira,et al.  Combining Tabu Search and Genetic Algorithm in a Multi-agent System for Solving Flexible Job Shop Problem , 2012, 2012 11th Mexican International Conference on Artificial Intelligence.

[7]  Mohsen Varmazyar,et al.  Minimizing the Number of Tardy Jobs in Flow Shop Sequence Dependent Setup Times Scheduling Problem , 2011 .

[8]  R. Moghaddas,et al.  Job-Shop Scheduling Problem With Sequence Dependent Setup Times , 2022 .

[9]  Camino R. Vela,et al.  An Efficient Memetic Algorithm for the Flexible Job Shop with Setup Times , 2013, ICAPS.

[10]  Meriem Ennigrou,et al.  Diversifying TS using GA in multi-agent system for solving Flexible Job Shop Problem , 2015, 2015 12th International Conference on Informatics in Control, Automation and Robotics (ICINCO).

[11]  Serol Bulkan,et al.  A hybrid algorithm for total tardiness minimisation in flexible job shop: genetic algorithm with parallel VNS execution , 2015 .

[12]  Jianguo Yang,et al.  Study on job shop scheduling with sequence-dependent setup times using biological immune algorithm , 2006 .

[13]  Khaled Ghédira,et al.  New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach , 2008, Autonomous Agents and Multi-Agent Systems.

[14]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[15]  Mohammad Saidi-Mehrabad,et al.  Flexible job shop scheduling with tabu search algorithms , 2007 .

[16]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

[17]  M. Zandieh,et al.  Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—Variable neighborhood search approach , 2011 .

[18]  M. Zandieh,et al.  Scheduling sequence-dependent setup time job shops with preventive maintenance , 2009 .

[19]  Mohsen Ziaee,et al.  A heuristic algorithm for solving flexible job shop scheduling problem , 2014 .

[20]  Mohammad Mirabi,et al.  A novel hybrid genetic algorithm to solve the sequence-dependent permutation flow-shop scheduling problem , 2014 .

[21]  N. Imanipour,et al.  Modeling & Solving Flexible Job Shop Problem With Sequence Dependent Setup Times , 2006, 2006 International Conference on Service Systems and Service Management.

[22]  Stephen F. Smith,et al.  Applying Iterative Flattening Search to the Job Shop Scheduling Problem with Alternative Resources and Sequence Dependent Setup Times , 2022 .

[23]  Amir Sadrzadeh,et al.  Development of Both the AIS and PSO for Solving the Flexible Job Shop Scheduling Problem , 2013 .

[24]  M. Mousakhani,et al.  Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness , 2013 .

[25]  Xiaoping Li,et al.  Adaptive Hybrid Algorithms for the Sequence-Dependent Setup Time Permutation Flow Shop Scheduling Problem , 2012, IEEE Transactions on Automation Science and Engineering.

[26]  Mouss,et al.  An effective Genetic Algorithm for the Flexible Job Shop Scheduling Problems , 2022 .

[27]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[28]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[29]  Hong Zhou,et al.  Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times , 2001, Ann. Oper. Res..

[30]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[31]  Lawrence Davis,et al.  Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

[32]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

[33]  Andrea Rossi,et al.  Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships , 2014 .

[34]  Mohammad Mirabi,et al.  Ant colony optimization technique for the sequence-dependent flowshop scheduling problem , 2011 .

[35]  Ehl Emile Aarts,et al.  A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .