Permutation flowshop scheduling to minimize the total tardiness with learning effects

Scheduling with learning effects has received considerable attention recently. Often, numbers of operations have to be done on every job in many manufacturing and assembly facilities. However, it is seldom discussed in the general multiple-machine setting, especially without the assumptions of identical processing time on all the machines or dominant machines. With the current emphasis of customer service and meeting the promised delivery dates, we consider a permutation flowshop scheduling problem with learning effects where the objective is to minimize the total tardiness. A branch-and-bound algorithm and two heuristic algorithms are established to search for the optimal and near-optimal solutions. Computational experiments are also given to evaluate the performance of the algorithms.

[1]  Yazid Mati,et al.  A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem , 2008, Comput. Oper. Res..

[2]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[3]  T. C. Edwin Cheng,et al.  Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects , 2008, Inf. Sci..

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

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

[6]  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..

[7]  Adam Janiak,et al.  A note on a makespan minimization problem with a multi-ability learning effect , 2010 .

[8]  Yeong-Dae Kim Minimizing total tardiness in permutation flowshops , 1995 .

[9]  Ji-Bo Wang,et al.  Single-machine scheduling problems with the effects of learning and deterioration , 2007 .

[10]  Ji-Bo Wang,et al.  Single-machine scheduling with general learning functions , 2008, Comput. Math. Appl..

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

[12]  Ji-Bo Wang,et al.  Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines , 2012 .

[13]  Lin-Yu Tseng,et al.  A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem , 2010 .

[14]  Adam Janiak,et al.  A new approach to the learning effect: Beyond the learning curve restrictions , 2008, Comput. Oper. Res..

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

[16]  Ling Wang,et al.  On three-machine flow shop scheduling with deteriorating jobs , 2010 .

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

[18]  Dvir Shabtay,et al.  A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system , 2012 .

[19]  Rubén Ruiz,et al.  Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics , 2008, Comput. Oper. Res..

[20]  T.C.E. Cheng,et al.  Two-machine flowshop scheduling with a truncated learning function to minimize the makespan , 2013 .

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

[22]  David Ben-Arieh,et al.  Annealing method for PCB assembly scheduling on two sequential machines , 1992 .

[23]  Xingong Zhang,et al.  Machine scheduling problems with a general learning effect , 2010, Math. Comput. Model..

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

[25]  Wen-Chiung Lee,et al.  A single-machine learning effect scheduling problem with release times , 2010 .

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

[27]  Ömer Kirca,et al.  A branch and bound algorithm to minimize the total tardiness for m , 2006, Eur. J. Oper. Res..

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

[29]  Zhiyong Xu,et al.  Some results of the worst-case analysis for flow shop scheduling with a learning effect , 2008, Annals of Operations Research.

[30]  Pei-Chann Chang,et al.  A note on due-date assignment and single machine scheduling with a learning/aging effect , 2009 .

[31]  Yeong-Dae Kim,et al.  Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process , 1996 .

[32]  Chuanli Zhao,et al.  Two-machine flow shop scheduling with deteriorating jobs and chain precedence constraints , 2012 .