A Mathematical Model and a Firefly Algorithm for an Extended Flexible Job Shop Problem with Availability Constraints

Manufacturing scheduling strategies have historically ignored the availability of the machines. The more realistic the schedule, more accurate the calculations and predictions. Availability of machines will play a crucial role in the Industry 4.0 smart factories. In this paper, a mixed integer linear programming model (MILP) and a discrete firefly algorithm (DFA) are proposed for an extended multi-objective FJSP with availability constraints (FJSP-FCR). Several standard instances of FJSP have been used to evaluate the performance of the model and the algorithm. New FJSP-FCR instances are provided. Comparisons among the proposed methods and other state-of-the-art reported algorithms are also presented. Alongside the proposed MILP model, a Genetic Algorithm is implemented for the experiments with the DFA. Extensive investigations are conducted to test the performance of the proposed model and the DFA. The comparisons between DFA and other recently published algorithms shows that it is a feasible approach for the stated problem.

[1]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[2]  Jianbo Yu,et al.  An effective heuristic for flexible job-shop scheduling problem with maintenance activities , 2010, Comput. Ind. Eng..

[3]  Mostafa Zandieh,et al.  An artificial immune algorithm for the flexible job-shop scheduling problem , 2010, Future Gener. Comput. Syst..

[4]  Quan-Ke Pan,et al.  Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems , 2011 .

[5]  Mitsuo Gen,et al.  Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm , 2006, J. Intell. Manuf..

[6]  Pierre Borne,et al.  Minimizing the makespan for the MPM job-shop with availability constraints , 2008 .

[7]  Quan-Ke Pan,et al.  A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion , 2015, Expert Syst. Appl..

[8]  Holger Voos,et al.  Comparative study of genetic and discrete firefly algorithm for combinatorial optimization , 2018, SAC.

[9]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[10]  Li-Ning Xing,et al.  Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling , 2009, Appl. Soft Comput..

[11]  Yunus Demir,et al.  Evaluation of mathematical models for flexible job-shop scheduling problems , 2013 .

[12]  Lale Özbakır,et al.  Mathematical models for job-shop scheduling problems with routing and process plan flexibility , 2010 .

[13]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[14]  Hua Xu,et al.  Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms , 2015, IEEE Transactions on Automation Science and Engineering.