International Journal of Industrial Engineering Computations 1 (2010) 1–10

This research discusses an integer batch scheduling problems for a single-machine with positiondependent batch processing time due to the simultaneous effect of learning and forgetting. The decision variables are the number of batches, batch sizes, and the sequence of the resulting batches. The objective is to minimize total actual flow time, defined as total interval time between the arrival times of parts in all respective batches and their common due date. There are two proposed algorithms to solve the problems. The first is developed by using the Integer Composition method, and it produces an optimal solution. Since the problems can be solved by the first algorithm in a worst-case time complexity O(n2 n-1 ), this research proposes the second algorithm. It is a heuristic algorithm based on the Lagrange Relaxation method. Numerical experiments show that the heuristic algorithm gives outstanding results.

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

[2]  Wen-Chiung Lee,et al.  A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects , 2015 .

[3]  Maurice Bonney,et al.  Production breaks and the learning curve: The forgetting phenomenon , 1996 .

[4]  Suresh Chand,et al.  Learning and forgetting effects on a group scheduling problem , 2008, Eur. J. Oper. Res..

[5]  Dar-Li Yang,et al.  Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect , 2006, Eur. J. Oper. Res..

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

[7]  T. Cheng,et al.  An economic manufacturing quantity model with learning effects , 1994 .

[8]  Wen-Chiung Lee,et al.  Single-machine scheduling with learning and forgetting effects , 2013 .

[9]  Uday S. Karmarkar,et al.  Batching to minimize flow times on one machine , 1987 .

[10]  T. P. Wright,et al.  Factors affecting the cost of airplanes , 1936 .

[11]  T. C. Edwin Cheng,et al.  Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position , 2013, Inf. Sci..

[12]  T. C. Edwin Cheng,et al.  Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan , 2007, Eur. J. Oper. Res..

[13]  Flávio Sanson Fogliatto,et al.  Scheduling learning dependent jobs in customised assembly lines , 2010 .

[14]  James E. Ward,et al.  Effect of Learning and Forgetting on Batch Sizes , 2011 .

[15]  Huan Neng Chiu,et al.  DETERMINISTIC TIME‐VARYING DEMAND LOT‐SIZING MODELS WITH LEARNING AND FORGETTING IN SETUPS AND PRODUCTION , 2003 .

[16]  Huan Neng Chiu,et al.  An optimal algorithm for solving the dynamic lot-sizing model with learning and forgetting in setups and production , 2005 .

[17]  Mustafa Uzumeri,et al.  Experiential learning and forgetting for manual and cognitive tasks , 2000 .

[18]  Stanislaw Gawiejnowicz,et al.  A Note on Scheduling on a Single Processor with Speed Dependent on a Number of Executed Jobs , 1996, Inf. Process. Lett..

[19]  Adam Janiak,et al.  Scheduling Jobs with Linear Model of Simultaneous Ageing and Learning Effects , 2011 .

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

[21]  Hiroshi Ohta,et al.  Batch-scheduling problems to minimize inventory cost in the shop with both receiving and delivery just-in-times , 1994 .

[22]  A. Shtub,et al.  Learning and forgetting in mental and mechanical tasks: a comparative study , 1997 .

[23]  Mohamad Y. Jaber,et al.  Learning Curves : Theory, Models, and Applications , 2011 .

[24]  I. Steedman.  SOME IMPROVEMENT CURVE THEORY , 1970 .

[25]  T.C.E. Cheng,et al.  AN ECONOMIC PRODUCTION QUANTITY MODEL WITH LEARNING AND FORGETTING CONSIDERATIONS , 1994 .

[26]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[27]  Mohamad Y. Jaber,et al.  Optimal lot sizing under learning considerations: Shortages allowed and backordered , 1995 .

[28]  Hiroshi Ohta,et al.  Batch-scheduling problems to minimize actual flow times of parts through the shop under JIT environment , 1994 .

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

[30]  T. C. E. Cheng,et al.  Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan , 2010, Eur. J. Oper. Res..

[31]  Kenneth R. Baker,et al.  Principles of Sequencing and Scheduling , 2018 .

[32]  Huan Neng Chiu,et al.  Discrete time-varying demand lot-sizing models with learning and forgetting effects , 1997 .

[33]  E. C. Keachie,et al.  Effects of Learning on Optimal Lot Size , 1966 .

[34]  James E. Ward,et al.  Batch sizing under learning and forgetting: Steady state characteristics for the constant demand case , 2008, Oper. Res. Lett..

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

[36]  Chih-Chung Lo,et al.  Optimal lot size with learning consideration on an imperfect production system with allowable shortages , 2008 .

[37]  David J. Evans,et al.  A New Method for Generating Integer Compositions in Parallel , 1996, Parallel Algorithms Appl..