Group Scheduling with General Autonomous and Induced Learning Effect

In recent research, induced learning requires management involvement. The initial investment can be interpreted as induced learning via an investment in the creation of technological knowledge or knowledge transfer. Induced learning has received attention in productivity improvement. In this paper, we consider scheduling problems with autonomous and induced learning under group technology. The jobs’ processing times decrease according to a learning rate which conversely increases the investment cost. The objectives of the scheduling problems are to minimize a linear combination of the makespan and the investment cost and a linear combination of the total completion time and the investment cost. We present polynomial algorithms to determine the optimal job sequence, group sequence, and the percentage reduction of the standard learning rate.

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

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

[3]  Dirk Simons,et al.  Common due date scheduling with autonomous and induced learning , 2004, Eur. J. Oper. Res..

[4]  George Steiner,et al.  Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine , 2013, Eur. J. Oper. Res..

[5]  Radosław Rudek,et al.  On single processor scheduling problems with learning dependent on the number of processed jobs , 2013 .

[6]  Ji-Bo Wang,et al.  Flowshop scheduling with a general exponential learning effect , 2014, Comput. Oper. Res..

[7]  Xue Huang,et al.  Single-machine group scheduling with general deterioration and learning effects , 2012 .

[8]  Cai-Min Wei,et al.  Single machine quadratic penalty function scheduling with deteriorating jobs and group technology , 2010 .

[9]  Ming Liu,et al.  Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect , 2013 .

[10]  Wen-Chiung Lee,et al.  Single-machine scheduling with two competing agents and learning consideration , 2013, Inf. Sci..

[11]  Ji-Bo Wang,et al.  Worst case analysis of flow shop scheduling problems with a time-dependent learning effect , 2013 .

[12]  Wen-Chiung Lee,et al.  A note on optimal policies for two group scheduling problems with deteriorating setup and processing times , 2010, Comput. Ind. Eng..

[13]  Wen-Chiung Lee,et al.  Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs , 2012, Appl. Math. Comput..

[14]  Suh-Jenq Yang,et al.  Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine , 2011 .

[15]  Wen-Chiung Lee,et al.  A note on single-machine group scheduling problems with position-based learning effect , 2009 .

[16]  Yu-Bin Wu,et al.  Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects , 2013 .

[17]  Ji-Bo Wang,et al.  Single machine scheduling with autonomous learning and induced learning , 2013, Comput. Ind. Eng..

[18]  Radoslaw Rudek,et al.  Scheduling on parallel processors with varying processing times , 2017, Comput. Oper. Res..

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