More MILP models for hybrid flow shop scheduling problem and its extended problems

With the rapid development of computer technology and related softwares for mathematical models, mathematical modelling of scheduling problems is receiving growing attention from researchers. In this work, the hybrid flow shop scheduling problem with unrelated parallel machines (HFSP-UPM) with the objective aimed to minimise the makespan is studied. According to the characteristics of the HFSP-UPM, eight mixed integer linear programming (MILP) models are formulated in order to obtain optimal solutions based on different modelling ideas. Then, these models are extended to solve HFSP-UPM with sequence-dependent setup times (HFSP-UPM-SDST), no-wait HFSP-UPM (HFSP-UPM-NW) and HFSP-UPM with blocking (HFSP-UPM-B). All the proposed models and the existing model are detailedly compared and evaluated under three aspects namely modelling process, size complexity and computational complexity. Numerical experiments show that MILP models dependent on diverse modelling ideas perform very differently. The model developed based on stage precedence is the best one and should be given preference in future applications. In addition, the proposed models of HFSP-UPM-NW and HFSP-UPM-B improve several best known solutions for the test instances in the existing literature.

[1]  R. Venkata Rao,et al.  Teaching–Learning-based Optimization Algorithm , 2016 .

[2]  Xinyu Shao,et al.  MILP models for energy-aware flexible job shop scheduling problem , 2019, Journal of Cleaner Production.

[3]  Liang Gao,et al.  Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem , 2019, Expert Syst. Appl..

[4]  Yuyan Han,et al.  Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions , 2018 .

[5]  R. Shafaei,et al.  An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines , 2014 .

[6]  Xinyu Shao,et al.  Mathematical modelling and optimisation of energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines , 2018, Int. J. Prod. Res..

[7]  Philippe Baptiste,et al.  Solving hybrid flow shop problem using energetic reasoning and global operations , 2001 .

[8]  Fariborz Jolai,et al.  No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach , 2015, J. Intell. Manuf..

[9]  Quan-Ke Pan,et al.  Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm , 2015, Inf. Sci..

[10]  Marius M. Solomon,et al.  A computational study of heuristics for two-stage flexible flowshops , 1996 .

[11]  Fariborz Jolai,et al.  A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times , 2012 .

[12]  Quan-Ke Pan,et al.  A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem , 2014, Appl. Soft Comput..

[13]  Reza Tavakkoli-Moghaddam,et al.  A memetic algorithm for the flexible flow line scheduling problem with processor blocking , 2009, Comput. Oper. Res..

[14]  Bahman Naderi,et al.  Hybrid flexible flowshop problems: Models and solution methods , 2014 .

[15]  Ling Wang,et al.  A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation , 2014 .

[16]  Zhang Qi-lian.  Hybrid PSO-NEH algorithm for solving no-wait flexible flow shop scheduling problem , 2014 .

[17]  T. C. Edwin Cheng,et al.  Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop , 2003, Eur. J. Oper. Res..

[18]  Mostafa Zandieh,et al.  An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines , 2010 .

[19]  Quan-Ke Pan,et al.  Iterated Greedy methods for the distributed permutation flowshop scheduling problem , 2019, Omega.

[20]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[21]  Wang Shengyao.  An artificial bee colony algorithm for solving hybrid flow-shop scheduling problem with unrelated parallel machines , 2012 .

[22]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

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

[24]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

[25]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[26]  Junqing Li,et al.  Optimal chiller loading by improved artificial fish swarm algorithm for energy saving , 2019, Math. Comput. Simul..

[27]  Liang Gao,et al.  A multi-start variable neighbourhood descent algorithm for hybrid flowshop rescheduling , 2019, Swarm Evol. Comput..

[28]  Chaoyong Zhang,et al.  An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem , 2017, Int. J. Prod. Res..

[29]  Peter Brucker,et al.  Job-shop Scheduling Problem , 2009, Encyclopedia of Optimization.

[30]  MengChu Zhou,et al.  Disassembly Sequence Planning Considering Fuzzy Component Quality and Varying Operational Cost , 2018, IEEE Transactions on Automation Science and Engineering.

[31]  Pedro Gómez-Gasquet,et al.  An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan , 2012, Expert Syst. Appl..

[32]  Junqing Li,et al.  An Efficient Optimization Algorithm for Resource-Constrained Steelmaking Scheduling Problems , 2018, IEEE Access.

[33]  Zhi xin Zheng,et al.  Optimal chiller loading by improved invasive weed optimization algorithm for reducing energy consumption , 2018 .

[34]  Maged M. Dessouky,et al.  Flowshop scheduling with identical jobs and uniform parallel machines , 1998, Eur. J. Oper. Res..

[35]  Rubén Ruiz,et al.  Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..

[36]  Chinyao Low,et al.  Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines , 2005, Comput. Oper. Res..

[37]  Scott J. Mason,et al.  Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems , 2010, Comput. Ind. Eng..

[38]  G. M. Komaki,et al.  Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems , 2016 .

[39]  Chao-Hsien Pan,et al.  A study of integer programming formulations for scheduling problems , 1997, Int. J. Syst. Sci..

[40]  Yong Wang,et al.  Solving chiller loading optimization problems using an improved teaching‐learning‐based optimization algorithm , 2018 .

[41]  Liang Gao,et al.  Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times , 2017, Appl. Math. Comput..

[42]  Quan-Ke Pan,et al.  An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation , 2014, Inf. Sci..