Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences

In this paper, we consider the bi-criteria single machine scheduling problem of n jobs with a learning effect. The two objectives considered are the total completion time (TC) and total absolute differences in completion times (TADC). The objective is to find a sequence that performs well with respect to both the objectives: the total completion time and the total absolute differences in completion times. In an earlier study, a method of solving bi-criteria transportation problem is presented. In this paper, we use the methodology of solving bi-criteria transportation problem, to our bi-criteria single machine scheduling problem with a learning effect, and obtain the set of optimal sequences,. Numerical examples are presented for illustrating the applicability and ease of understanding.

[1]  Gur Mosheiov,et al.  Scheduling problems with a learning effect , 2001, Eur. J. Oper. Res..

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

[3]  Adam Janiak,et al.  The learning effect: Getting to the core of the problem , 2007, Inf. Process. Lett..

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

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

[6]  Dar-Li Yang,et al.  Minimizing the makespan in a single machine scheduling problem with a time-based learning effect , 2006, Inf. Process. Lett..

[7]  Gur Mosheiov,et al.  Note on scheduling with general learning curves to minimize the number of tardy jobs , 2005, J. Oper. Res. Soc..

[8]  S. S. Panwalkar,et al.  Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

[9]  Gur Mosheiov,et al.  Parallel machine scheduling with a learning effect , 2001, J. Oper. Res. Soc..

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

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

[12]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

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

[14]  Louis E. Yelle.  THE LEARNING CURVE: HISTORICAL REVIEW AND COMPREHENSIVE SURVEY , 1979 .

[15]  Prabuddha De,et al.  On the Minimization of Completion Time Variance with a Bicriteria Extension , 1992, Oper. Res..

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

[17]  Adam Janiak,et al.  Scheduling jobs with position-dependent processing times , 2004, J. Oper. Res. Soc..

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

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

[20]  Chin-Chia Wu,et al.  A bi-criteria two-machine flowshop scheduling problem with a learning effect , 2006, J. Oper. Res. Soc..

[21]  Wen-Chiung Lee,et al.  A bi-criterion single-machine scheduling problem with learning considerations , 2004, Acta Informatica.

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

[23]  Uttarayan Bagchi,et al.  Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems , 1989, Oper. Res..

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

[25]  Y. Aneja,et al.  BICRITERIA TRANSPORTATION PROBLEM , 1979 .