Isomorphic scheduling problems

We consider general properties of isomorphic scheduling problems that constitute a new class of pairs of mutually related scheduling problems. Any such a pair is composed of a scheduling problem with fixed job processing times and its time-dependent counterpart with processing times that are proportional-linear functions of the job starting times. In order to introduce the class formally, first we formulate a generic scheduling problem with fixed job processing times and define isomorphic problems by a one-to-one transformation of instances of the generic problem into instances of time-dependent scheduling problems with proportional-linear job processing times. Next, we prove basic properties of isomorphic scheduling problems and show how to convert polynomial algorithms for scheduling problems with fixed job processing times into polynomial algorithms for proportional-linear counterparts of the original problems. Finally, we show how are related approximation algorithms for isomorphic problems. Applying the results, we establish new worst-case results for time-dependent parallel-machine scheduling problems and prove that many single- and dedicated-machine time-dependent scheduling problems with proportional-linear job processing times are polynomially solvable.

[1]  Gur Mosheiov,et al.  Complexity analysis of job-shop scheduling with deteriorating jobs , 2002, Discret. Appl. Math..

[2]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

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

[4]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[5]  Dar-Li Yang,et al.  Single-machine scheduling with both deterioration and learning effects , 2009, Ann. Oper. Res..

[6]  Stanislaw Gawiejnowicz,et al.  Parallel Machine Scheduling of Deteriorating Jobs by Modified Steepest Descent Search , 2005, PPAM.

[7]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[8]  Michael Pinedo,et al.  Current trends in deterministic scheduling , 1997, Ann. Oper. Res..

[9]  Sartaj Sahni,et al.  Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.

[10]  Jan Karel Lenstra,et al.  Sequencing and scheduling : an annotated bibliography , 1997 .

[11]  Graham K. Rand,et al.  Logistics of Production and Inventory , 1995 .

[12]  T. C. Edwin Cheng,et al.  Single machine scheduling with deadlines and increasing rates of processing times , 2000, Acta Informatica.

[13]  Bahram Alidaee,et al.  Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..

[14]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[15]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[16]  Ertan Güner,et al.  The common due-date early/tardy scheduling problem on a parallelmachine under the effects of time-dependent learning and linear and nonlinear deterioration , 2010, Expert Syst. Appl..

[17]  T. C. Edwin Cheng,et al.  The Complexity of Scheduling Starting Time Dependent Tasks with Release Times , 1998, Inf. Process. Lett..

[18]  Alexander V. Kononov,et al.  Complexity and approximability of scheduling resumable proportionally deteriorating jobs , 2010, Eur. J. Oper. Res..

[19]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[20]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[21]  Bertrand M. T. Lin,et al.  A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..

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

[23]  V. A. Strusevich,et al.  Two-Machine Super-Shop Scheduling Problem , 1991 .

[24]  Christopher D. Geiger,et al.  A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration , 2010, Eur. J. Oper. Res..

[25]  Wen-Chiung Lee,et al.  A single-machine scheduling problem with two-agent and deteriorating jobs , 2010 .

[26]  Stanislaw Gawiejnowicz,et al.  Equivalent time-dependent scheduling problems , 2009, Eur. J. Oper. Res..

[27]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[28]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[29]  Michael Pinedo,et al.  Planning and Scheduling in Manufacturing and Services , 2008 .

[30]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[31]  Bertrand M. T. Lin,et al.  Scheduling time-dependent jobs under mixed deterioration , 2010, Appl. Math. Comput..

[32]  Stanislaw Gawiejnowicz,et al.  Conjugate problems in time-dependent scheduling , 2009, J. Sched..

[33]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[34]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[35]  Lixin Tang,et al.  Two-agent group scheduling with deteriorating jobs on a single machine , 2010 .