Multiple common due dates assignment and scheduling problems with resource allocation and general position-dependent deterioration effect

This paper investigates the single-machine multiple common due dates assignment and scheduling problems in which the processing time of a job depends on its position in a job sequence and its resource allocation. We examine the general position-dependent deterioration effect and two models of resource allocation. The objective function is to minimize a total penalty function containing earliness, tardiness, due date, and resource consumption costs. We introduce two polynomial time algorithms to solve the considered problems. Since the two algorithms solve the problems in polynomial time, they can solve large-scale instances of the problem under study in little time.

[1]  Clyde L. Monma,et al.  Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions , 1990, Math. Oper. Res..

[2]  Radosław Rudek,et al.  Some single-machine scheduling problems with the extended sum-of-processing-time-based aging effect , 2011, The International Journal of Advanced Manufacturing Technology.

[3]  R. G. Vickson,et al.  Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine , 1980, Oper. Res..

[4]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[5]  T.C.E. Cheng,et al.  Due-date assignment and single machine scheduling with compressible processing times , 1996 .

[6]  Dirk Biskup,et al.  Common due date assignment for scheduling on a single machine with jointly reducible processing times , 2001 .

[7]  Wen-Chiung Lee,et al.  Scheduling deteriorating jobs to minimize the makespan on a single machine , 2009 .

[8]  Ji-Bo Wang,et al.  Single-machine scheduling with simple linear deterioration to minimize earliness penalties , 2010 .

[9]  Ji-Bo Wang.  Single machine common flow allowance scheduling with controllable processing times , 2006 .

[10]  Dvir Shabtay,et al.  A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..

[11]  Ji-Bo Wang.  Single machine scheduling with common due date and controllable processing times , 2006, Appl. Math. Comput..

[12]  Li-Yan Wang,et al.  Single-machine scheduling with a time-dependent deterioration , 2009 .

[13]  Ji-Bo Wang,et al.  Single machine multiple common due dates scheduling with learning effects , 2010, Comput. Math. Appl..

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

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

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

[17]  Yonah Wilamowsky,et al.  Multiple common due dates , 2001 .

[18]  Dvir Shabtay,et al.  Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies , 2003 .

[19]  Dehua Xu,et al.  Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect , 2010 .

[20]  Eugeniusz Nowicki,et al.  A survey of results for sequencing problems with controllable processing times , 1990, Discret. Appl. Math..

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

[22]  Ji-Bo Wang,et al.  Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan , 2010 .

[23]  T. C. Edwin Cheng,et al.  Parallel-machine scheduling with simple linear deterioration to minimize total completion time , 2008, Eur. J. Oper. Res..

[24]  Michael A. Trick,et al.  Scheduling Multiple Variable-Speed Machines , 1990, Oper. Res..

[25]  T. C. Edwin Cheng,et al.  Single machine scheduling with a variable common due date and resource-dependent processing times , 2003, Comput. Oper. Res..

[26]  Pei-Chann Chang,et al.  A note on due-date assignment and single machine scheduling with a learning/aging effect , 2009 .

[27]  Dar-Li Yang,et al.  A note on due-date assignment and single-machine scheduling with deteriorating jobs , 2008, J. Oper. Res. Soc..

[28]  Suh-Jenq Yang,et al.  Parallel machines scheduling with deterioration effects and resource allocations , 2012 .

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

[30]  Stanislaw Gawiejnowicz,et al.  Time-Dependent Scheduling , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[31]  Ji-Bo Wang,et al.  Single-machine scheduling problems with the effects of learning and deterioration , 2007 .

[32]  Suresh Chand,et al.  A Single Machine Model for Determination of Optimal Due Dates and Sequence , 1992, Oper. Res..

[33]  M. Selim Akturk,et al.  A new bounding mechanism for the CNC machine scheduling problems with controllable processing times , 2005, Eur. J. Oper. Res..

[34]  Dehua Xu,et al.  Some scheduling problems with general position-dependent and time-dependent learning effects , 2009, Inf. Sci..

[35]  T. C. Edwin Cheng,et al.  Due-date assignment and single machine scheduling with deteriorating jobs , 2004, J. Oper. Res. Soc..

[36]  Dvir Shabtay,et al.  The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times , 2008, Ann. Oper. Res..