Uniform parallel-machine scheduling to minimize makespan with position-based learning curves

Scheduling with learning effects has become a popular topic in the past decade; however, most of the research focuses on single-machine problems. In many situations, there are machines in parallel and the skills of workers might be different due to their individual experience. In this paper, we study a uniform parallel machine problem in which the objective is to jointly find an optimal assignment of operators to machines and an optimal schedule to minimize the makespan. Two heuristic algorithms are proposed and computational experiments are conducted to evaluate their performance.

[1]  Tamer Eren,et al.  A bicriteria parallel machine scheduling with a learning effect of setup and removal times , 2009 .

[2]  Dan Wang,et al.  Single-machine scheduling with learning effect and resource-dependent processing times , 2010, Comput. Ind. Eng..

[3]  Stanislaw Gawiejnowicz,et al.  Exact and heuristic algorithms for parallel-machine scheduling with DeJong's learning effect , 2010, Comput. Ind. Eng..

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

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

[6]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

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

[9]  Bor-Wen Cheng,et al.  A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm , 2007, Expert Syst. Appl..

[10]  Radoslaw Rudek,et al.  Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect , 2011, Comput. Ind. Eng..

[11]  Ali Riza Yildiz,et al.  A new design optimization framework based on immune algorithm and Taguchi's method , 2009, Comput. Ind..

[12]  T. C. Edwin Cheng,et al.  Two-agent scheduling with position-based deteriorating jobs and learning effects , 2011, Appl. Math. Comput..

[13]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[14]  Ji-Bo Wang,et al.  Single-machine scheduling jobs with exponential learning functions , 2011, Comput. Ind. Eng..

[15]  Ertan Güner,et al.  Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration , 2009, Comput. Oper. Res..

[16]  Adam Janiak,et al.  Experience-Based Approach to Scheduling Problems With the Learning Effect , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[17]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[18]  Der-Chiang Li,et al.  Two-machine flowshop scheduling with truncated learning to minimize the total completion time , 2011, Comput. Ind. Eng..

[19]  Chou-Jung Hsu,et al.  An unrelated parallel machine scheduling problem with past-sequence-dependent setup time and learning effects , 2010, The 40th International Conference on Computers & Indutrial Engineering.

[20]  T. C. Edwin Cheng,et al.  Scheduling with job-dependent learning effects and multiple rate-modifying activities , 2010, Inf. Process. Lett..

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

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

[23]  T. C. Edwin Cheng,et al.  Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations , 2009, Inf. Sci..

[24]  Wen-Chiung Lee,et al.  Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects , 2011 .

[25]  R. J. Kuo,et al.  Integration of particle swarm optimization and genetic algorithm for dynamic clustering , 2012, Inf. Sci..

[26]  T. C. Edwin Cheng,et al.  Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities , 2012, Comput. Oper. Res..

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

[28]  Chou-Jung Hsu,et al.  Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects , 2011 .

[29]  Suh-Jenq Yang,et al.  Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption , 2011 .

[30]  Feng Chu,et al.  Single-machine group scheduling with resource allocation and learning effect , 2011, Comput. Ind. Eng..

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

[32]  T. C. Edwin Cheng,et al.  A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations , 2011, Comput. Ind. Eng..

[33]  Wen-Chiung Lee,et al.  Scheduling with general position-based learning curves , 2011, Inf. Sci..

[34]  T.C.E. Cheng,et al.  Scheduling problems with deteriorating jobs and learning effects including proportional setup times , 2010, Comput. Ind. Eng..

[35]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[36]  Wen-Chiung Lee,et al.  Single-machine scheduling problems with a learning effect , 2008 .

[37]  Wen-Chiung Lee,et al.  Two-agent scheduling with learning consideration , 2011, Comput. Ind. Eng..

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

[39]  Ji-Bo Wang,et al.  Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect , 2010, Comput. Math. Appl..

[40]  Dar-Li Yang,et al.  Single-machine group scheduling with a time-dependent learning effect , 2006, Comput. Oper. Res..