Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints

The flow shop scheduling problem is an attractive subject in the field of scheduling, which has attracted the attention of many researchers in the past five decades. In this paper, the non-permutation flow shop scheduling problem with the learning effects and machine availability constraints has been studied for minimizing the total flow time as a performance measure. First, a mixed integer linear programming model has been proposed for the modeling of the problem and then, an effective improving heuristic method, which is able to find proper non-permutation solutions, has been presented. Finally, the computational results are used for evaluation the performance and effectiveness of the proposed heuristic.

[1]  Ehram Safari,et al.  A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown , 2011, Expert Syst. Appl..

[2]  J.-B. Wang,et al.  A note on scheduling problems with learning effect and deteriorating jobs , 2006, Int. J. Syst. Sci..

[3]  Chin-Chia Wu,et al.  Simulated-annealing heuristics for the single-machine scheduling problem with learning and unequal job release times , 2011 .

[4]  Suh-Jenq Yang,et al.  Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration , 2010, Appl. Math. Comput..

[5]  Chengbin Chu,et al.  A survey of scheduling with deterministic machine availability constraints , 2010, Comput. Ind. Eng..

[6]  J. V. Howard.  How to give away £100 million: information for senior decision makers , 1981 .

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

[8]  Wen-Chiung Lee,et al.  Some single-machine and m-machine flowshop scheduling problems with learning considerations , 2009, Inf. Sci..

[9]  Chin-Chia Wu,et al.  Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions , 2013, J. Oper. Res. Soc..

[10]  Yu-Hsiang Chung,et al.  Makespan minimization for m-machine permutation flowshop scheduling problem with learning considerations , 2011 .

[11]  Reza Tavakkoli-Moghaddam,et al.  Solving a single-machine scheduling problem with maintenance, job deterioration and learning effect by simulated annealing , 2010 .

[12]  Li-Man Liao,et al.  Heuristic algorithms for two-machine flowshop with availability constraints , 2009, Comput. Ind. Eng..

[13]  Chin-Chia Wu,et al.  A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function , 2012 .

[14]  Riad Aggoune,et al.  Minimizing the makespan for the flow shop scheduling problem with availability constraints , 2001, Eur. J. Oper. Res..

[15]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[16]  Wen-Chiung Lee,et al.  Single-machine and flowshop scheduling with a general learning effect model , 2009, Comput. Ind. Eng..

[17]  T. C. Edwin Cheng,et al.  Some scheduling problems with deteriorating jobs and learning effects , 2008, Comput. Ind. Eng..

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

[19]  Jose M. Framiñan,et al.  Production , Manufacturing and Logistics Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation , 2002 .

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

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

[22]  Barry Render,et al.  Operations Management , 2019, CCSP (ISC)2 Certified Cloud Security Professional Official Study Guide, 2nd Edition.

[23]  Chwen-Tzeng Su,et al.  A single-machine scheduling problem with maintenance activities to minimize makespan , 2010, Appl. Math. Comput..

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

[25]  Jose M. Framinan,et al.  Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics , 2009, Comput. Oper. Res..

[26]  Bernard W. Taylor,et al.  Operations management : multimedia version , 2000 .

[27]  Marie-Claude Portmann,et al.  Flow shop scheduling problem with limited machine availability: A heuristic approach , 2003 .

[28]  Chin-Chia Wu,et al.  Minimizing total completion time in a two-machine flowshop with a learning effect , 2004 .

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

[30]  J.-B. Wang,et al.  Flow-shop scheduling with a learning effect , 2005, J. Oper. Res. Soc..

[31]  Wen-Chiung Lee,et al.  A note on the total completion time problem in a permutation flowshop with a learning effect , 2009, Eur. J. Oper. Res..