Multi-criteria blocking flow shop scheduling problems: Formulation and performance analysis

Most of the prior investigations related to production scheduling problems have solely focused on the optimization of an individual criterion under a single constraint; nevertheless, this is most of the time out of true in a real situation. This paper deals with multi machines permutation flow shop scheduling with limited buffers capacity and different release dates of jobs, where the performance is measured by the minimization of the weighted sum of maximum tardiness and makespan. To tackle this NP-hard problem, we present a mixed-integer linear programming model (MILP). Thereafter, using CPLEX software, we generate a set of tests in an endeavor to examine formulation for dissimilar size problems in terms of optimality solution and computational CPU time complexity. Experiment results show that overall the proposed model is computationally avaricious to solve the considering problem. © 2018 PEI, University of Maribor. All rights reserved.

[1]  Jerzy Kamburowski,et al.  An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times , 2012, Comput. Oper. Res..

[2]  Wajdi Trabelsi,et al.  Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems , 2012, Comput. Oper. Res..

[3]  C. Chu.  A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .

[4]  Reinaldo J. Moraga,et al.  Scheduling Blocking Flow Shops Using Meta-RaPS , 2015, Complex Adaptive Systems.

[5]  Ghasem Moslehi,et al.  Optimizing blocking flow shop scheduling problem with total completion time criterion , 2013, Comput. Oper. Res..

[6]  Débora P. Ronconi,et al.  Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness , 2012 .

[7]  Hiroyuki Tamura,et al.  A new multiobjective genetic algorithm with heterogeneous population for solving flowshop scheduling problems , 2007, Int. J. Comput. Integr. Manuf..

[8]  Bassem Jarboui,et al.  Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem , 2016, J. Comput. Des. Eng..

[9]  R. L. Daniels,et al.  Multiobjective flow-shop scheduling , 1990 .

[10]  Mohammad Taghi Rezvan,et al.  A branch-and-bound algorithm for minimising the number of tardy jobs in a two-machine flow-shop problem with release dates , 2014, Int. J. Comput. Integr. Manuf..

[11]  Kenneth R. Baker,et al.  Solving the single-machine sequencing problem using integer programming , 2010, Comput. Ind. Eng..

[12]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization , 1999 .

[13]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[14]  Mehmet Fatih Tasgetiren,et al.  Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion , 2017, Comput. Oper. Res..

[15]  Liang Zhang,et al.  An effective hybrid genetic algorithm for flow shop scheduling with limited buffers , 2006, Comput. Oper. Res..

[16]  X. W. Huang,et al.  An Improved Genetic Algorithm for Job-Shop Scheduling Problem with Process Sequence Flexibility , 2014 .

[17]  Wajdi Trabelsi,et al.  Ordonnancement des systèmes de production flexibles soumis à différents types de contraintes de blocage. (Scheduling of flexible manufacturing systems subject to mixed blocking constraints) , 2012 .

[18]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[19]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[20]  Ali Allahverdi,et al.  A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness , 2004, Comput. Oper. Res..

[21]  Jatinder N. D. Gupta,et al.  Comparative evaluation of MILP flowshop models , 2005, J. Oper. Res. Soc..

[22]  Victor Fernandez-Viagas,et al.  Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness , 2015, Comput. Oper. Res..

[23]  Xu.  Solving dual flexible job ‐ shop scheduling problem using a Bat Algorithm , 2017 .

[24]  Abdellah El Barkany,et al.  Scheduling Problems of Flexible Manufacturing Systems: Review, Classification and Opportunities , 2016 .

[25]  R. Sahraeian,et al.  Solving Single Machine Sequencing to Minimize Maximum Lateness Problem Using Mixed Integer Programming , 2015 .