A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration

ABSTRACT This article addresses a two-stage, three-machine assembly scheduling problem that considers the learning effect. All jobs are processed on two machines in the first stage and move on to be processed on an assembly machine in the second stage. The objective of the study is to minimize the total completion time of the given jobs. Because the problem is NP hard, the authors first established a lower bound and several adjacent propositions using a branch-and-bound algorithm to search for the optimal solution. Four metaheuristics are proposed to approximate the solutions: genetic algorithms, cloud theory-based simulated annealing, artificial bee colonies and iterated greedy algorithms. Four different heuristics are used as seeds in each metaheuristic to obtain high-quality approximate solutions. The performances of all 16 metaheuristics and the branch-and-bound algorithm are then examined and are reported herein.

[1]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

[2]  Ji-Bo Wang,et al.  Research on m-machine flow shop scheduling with truncated learning effects , 2019, Int. Trans. Oper. Res..

[3]  Mostafa Zandieh,et al.  Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop , 2010, Adv. Eng. Softw..

[4]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[5]  Ji-Bo Wang,et al.  Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect , 2018, Engineering Optimization.

[6]  Louis E. Yelle.  THE LEARNING CURVE: HISTORICAL REVIEW AND COMPREHENSIVE SURVEY , 1979 .

[7]  Jose M. Framiñan,et al.  The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic , 2017, Comput. Oper. Res..

[8]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[9]  Dehua Xu,et al.  Some scheduling problems with general position-dependent and time-dependent learning effects , 2009, Inf. Sci..

[10]  MengChu Zhou,et al.  Single-Machine Scheduling With Job-Position-Dependent Learning and Time-Dependent Deterioration , 2012, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[11]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[12]  Christos Koulamas,et al.  The three-stage assembly flowshop scheduling problem , 2001, Comput. Oper. Res..

[13]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

[14]  Dirk Biskup,et al.  Single-machine scheduling with learning considerations , 1999, Eur. J. Oper. Res..

[15]  Ji-Bo Wang,et al.  Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint , 2019 .

[16]  Christos Koulamas,et al.  A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines , 2007, Eur. J. Oper. Res..

[17]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[18]  Chin-Chia Wu,et al.  A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects , 2014, Inf. Sci..

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

[20]  Chin-Chia Wu,et al.  Single-machine common/slack due window assignment problems with linear decreasing processing times , 2017 .

[21]  Mohammad Yavari,et al.  Integrated decision making for parts ordering and scheduling of jobs on two-stage assembly problem in three level supply chain , 2018 .

[22]  Dirk Biskup,et al.  A state-of-the-art review on scheduling with learning effects , 2008, Eur. J. Oper. Res..

[23]  Victor Fernandez-Viagas,et al.  Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures , 2019, Eur. J. Oper. Res..

[24]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[25]  Dehua Xu,et al.  Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect , 2010 .

[26]  Colin R. Reeves,et al.  Heuristics for scheduling a single machine subject to unequal job release times , 1995 .

[27]  Guanghui Zhang,et al.  Memetic social spider optimization algorithm for scheduling two-stage assembly flowshop in a distributed environment , 2018, Comput. Ind. Eng..

[28]  Guoqing Wang,et al.  Single Machine Scheduling with Learning Effect Considerations , 2000, Ann. Oper. Res..

[29]  Alok Singh,et al.  Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates , 2017, Oper. Res..

[30]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[31]  Fawaz S. Al-Anzi,et al.  A Hybrid Tabu Search Heuristic for the Two-Stage Assembly Scheduling Problem , 2006 .

[32]  Ji-Bo Wang,et al.  A note on resource allocation scheduling with group technology and learning effects on a single machine , 2017 .

[33]  Fawaz S. Al-Anzi,et al.  The two-stage assembly scheduling problem to minimize total completion time with setup times , 2009, Comput. Oper. Res..

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

[35]  Imma Ribas,et al.  An iterated greedy algorithm for the flowshop scheduling problem with blocking , 2011 .

[36]  Meriem Ennigrou,et al.  Scheduling problems under learning effects: classification and cartography , 2018, Int. J. Prod. Res..

[37]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[38]  Ali Tozkapan,et al.  A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem , 2003, Comput. Oper. Res..

[39]  Chin-Chia Wu,et al.  A two-stage three-machine assembly flow shop scheduling with learning consideration to minimize the flowtime by six hybrids of particle swarm optimization , 2018, Swarm Evol. Comput..

[40]  F. D. Croce,et al.  The two-machine total completion time flow shop problem , 1996 .

[41]  Chin-Chia Wu,et al.  A two-stage three-machine assembly scheduling problem with a position-based learning effect , 2018, Int. J. Prod. Res..

[42]  Paul Higgins,et al.  Manufacturing Planning and Control: Beyond MRP II , 1996 .

[43]  Yunqiang Yin,et al.  The single-machine total weighted tardiness scheduling problem with position-based learning effects , 2012, Comput. Oper. Res..

[44]  Chin-Chia Wu,et al.  Dominance rule and opposition-based particle swarm optimization for two-stage assembly scheduling with time cumulated learning effect , 2019, Soft Comput..

[45]  G. Nadler,et al.  MANUFACTURING PROGRESS FUNCTIONS FOR TYPES OF PROCESSES , 1963 .

[46]  Keyi Xing,et al.  Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times , 2019 .

[47]  Chin-Chia Wu,et al.  A two-stage three-machine assembly scheduling problem with deterioration effect , 2019, Int. J. Prod. Res..

[48]  Dehua Xu,et al.  A generalisation model of learning and deteriorating effects on a single-machine scheduling with past-sequence-dependent setup times , 2012, Int. J. Comput. Integr. Manuf..