Several flow shop scheduling problems with truncated position-based learning effect

The concept of truncated position-based learning process plays a key role in production environments. However, it is relatively unexplored in the flow shop setting. In this paper, we consider the flow shop scheduling with truncated position-based learning effect, i.e., the actual processing time of a job is a function of its position and a control parameter in a processing permutation. The objective is to minimize one of the six regular performance criteria, namely, the total completion time, the makespan, the total weighted completion time, the discounted total weighted completion time, the sum of the quadratic job completion times, and the maximum lateness. We present heuristic algorithms and analyze the worst-case bound of these heuristic algorithms. We also provide the computational results to evaluate the performance of the heuristics.

[1]  Gur Mosheiov,et al.  Scheduling on parallel identical machines with job-rejection and position-dependent processing times , 2012, Inf. Process. Lett..

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

[3]  Chin-Chia Wu,et al.  Some polynomial solvable single-machine scheduling problems with a truncation sum-of-processing-times based learning effect , 2012 .

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

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

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

[7]  Christos Koulamas,et al.  Single-machine and two-machine flowshop scheduling with general learning functions , 2007, Eur. J. Oper. Res..

[8]  J.-B. Wang,et al.  Worst-case analysis for flow shop scheduling problems with an exponential learning effect , 2012, J. Oper. Res. Soc..

[9]  Gur Mosheiov,et al.  Total absolute deviation of job completion times on uniform and unrelated machines , 2011, Comput. Oper. Res..

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

[11]  W. Townsend.  The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution , 1978 .

[12]  Han Hoogeveen,et al.  Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases , 1999, Math. Oper. Res..

[13]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[16]  J.-B. Wang.  Single machine scheduling with a time-dependent learning effect and deteriorating jobs , 2009, J. Oper. Res. Soc..

[17]  Adam Janiak,et al.  Solution algorithms for the makespan minimization problem with the general learning model , 2009, Comput. Ind. Eng..

[18]  Czeslaw Smutnicki,et al.  Some results of the worst-case analysis for flow shop scheduling , 1998, Eur. J. Oper. Res..

[19]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .

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

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

[22]  SahniSartaj,et al.  Flowshop and Jobshop Schedules , 1978 .

[23]  George J. Kyparisis,et al.  Algorithms with performance guarantees for flow shops with regular objective functions , 2005 .

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

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

[26]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[27]  Wen-Chiung Lee,et al.  A two-machine flowshop maximum tardiness scheduling problem with a learning effect , 2006 .

[28]  Gur Mosheiov,et al.  Proportionate flowshops with general position-dependent processing times , 2011, Inf. Process. Lett..

[29]  Hoon-Shik Woo,et al.  A heuristic algorithm for mean flowtime objective in flowshop scheduling , 1998, Comput. Oper. Res..

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

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

[32]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[33]  Chin-Chia Wu,et al.  Some single-machine scheduling problems with a truncation learning effect , 2011, Comput. Ind. Eng..

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

[35]  Gur Mosheiov,et al.  A due-window assignment problem with position-dependent processing times , 2008, J. Oper. Res. Soc..

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

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

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

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

[40]  Daniel Oron,et al.  Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times , 2012, Comput. Oper. Res..

[41]  Ji-Bo Wang,et al.  Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects , 2011, Ann. Oper. Res..

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

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

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

[45]  Ertan Güner,et al.  A bicriteria flowshop scheduling with a learning effect , 2008 .

[46]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .