Constraint Programming for Modeling and Solving a Hybrid Flow Shop Scheduling Problem

As an extension of a flow shop scheduling problem, hybrid flow shop scheduling problems (HFSP) have been widely concerned. Their characteristics are that every stage has parallel machines, and every job has more complicated production routes than a classical flow shop problem. Currently, most research about HFSP is based on meta-heuristic algorithms, especially evolutionary algorithms. In this article, we provide new models and solution methods based on constraint programming (CP). According to our experiments conducted on benchmark datasets, CP shows great performance in comparison with other competitive solution methods. It renews the best-found solutions of some benchmark instances. For the instances that cannot be solved exactly, it can provide a high-accuracy feasible solution as an upper bound and a relaxed infeasible solution as a lower bound.

[1]  Ying Tang,et al.  Stochastic Hybrid Discrete Grey Wolf Optimizer for Multi-Objective Disassembly Sequencing and Line Balancing Planning in Disassembling Multiple Products , 2022, IEEE Transactions on Automation Science and Engineering.

[2]  MengChu Zhou,et al.  Iterated Greedy Algorithms for Flow-Shop Scheduling Problems: A Tutorial , 2022, IEEE Transactions on Automation Science and Engineering.

[3]  Ziyan Zhao,et al.  Heuristic Scheduling of Batch Production Processes Based on Petri Nets and Iterated Greedy Algorithms , 2022, IEEE Transactions on Automation Science and Engineering.

[4]  Mengchu Zhou,et al.  A machine learning and genetic algorithm-based method for predicting width deviation of hot-rolled strip in steel production systems , 2021, Inf. Sci..

[5]  Liang Gao,et al.  A Hybrid Evolutionary Algorithm Using Two Solution Representations for Hybrid Flow-Shop Scheduling Problem , 2021, IEEE Transactions on Cybernetics.

[6]  MengChu Zhou,et al.  Dual-Objective Mixed Integer Linear Program and Memetic Algorithm for an Industrial Group Scheduling Problem , 2021, IEEE/CAA Journal of Automatica Sinica.

[7]  Qianwang Deng,et al.  Multi-objective evolutionary algorithms with heuristic decoding for hybrid flow shop scheduling problem with worker constraint , 2020, Expert Syst. Appl..

[8]  MengChu Zhou,et al.  Decomposition Method for New Single-Machine Scheduling Problems From Steel Production Systems , 2020, IEEE Transactions on Automation Science and Engineering.

[9]  Hesuan Hu,et al.  Scheduling dual-arm cluster tools with multiple wafer types and residency time constraints , 2020, IEEE/CAA Journal of Automatica Sinica.

[10]  Victor Fernandez-Viagas,et al.  Design of a testbed for hybrid flow shop scheduling with identical machines , 2020, Comput. Ind. Eng..

[11]  Quan-Ke Pan,et al.  Metaheuristic algorithms for the hybrid flowshop scheduling problem , 2019, Comput. Oper. Res..

[12]  MengChu Zhou,et al.  Iterated Greedy Algorithm for Solving a New Single Machine Scheduling Problem , 2019, 2019 IEEE 16th International Conference on Networking, Sensing and Control (ICNSC).

[13]  MengChu Zhou,et al.  Grey Wolf Optimizer Adapted for Disassembly Sequencing Problems , 2019, 2019 IEEE 16th International Conference on Networking, Sensing and Control (ICNSC).

[14]  Tian-Soon Lee,et al.  A review of scheduling problem and resolution methods in flexible flow shop , 2019, International Journal of Industrial Engineering Computations.

[15]  Paul Shaw,et al.  IBM ILOG CP optimizer for scheduling , 2018, Constraints.

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

[17]  Reza Tavakkoli-Moghaddam,et al.  A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations , 2014 .

[18]  S. H. Choi,et al.  Flexible flow shop scheduling with stochastic processing times: A decomposition-based approach , 2012, Comput. Ind. Eng..

[19]  K.-C. Ying,et al.  An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks , 2009, J. Oper. Res. Soc..

[20]  Paveena Chaovalitwongse,et al.  Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria , 2008 .

[21]  Jacques Carlier,et al.  An Exact Method for Solving the Multi-Processor Flow-Shop , 2000, RAIRO Oper. Res..

[22]  Shaukat A. Brah,et al.  A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors , 1996 .