Scheduling linearly shortening jobs under precedence constraints

We consider the problem of scheduling a set of dependent jobs on a single machine with the maximum completion time criterion. The processing time of each job is variable and decreases linearly with respect to the starting time of the job. Applying a uniform approach based on the calculation of ratios of expressions that describe total processing times of chains of jobs, we show basic properties of the problem. On the basis of these properties, we prove that if precedence constraints among jobs are in the form of a set of chains, a tree, a forest or a series–parallel digraph, the problem can be solved in O(n log n) time, where n denotes the number of the jobs.

[1]  Eugene L. Lawler,et al.  The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..

[2]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Tasks with Time-Dependent Execution Times , 1993, Inf. Process. Lett..

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

[4]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

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

[6]  T.C.E. Cheng,et al.  Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint , 2008, Comput. Oper. Res..

[7]  Anand S. Kunnathur,et al.  Optimal repayment policies for multiple loans , 1987 .

[8]  V. Tanaev,et al.  Scheduling theory single-stage systems , 1994 .

[9]  Stanislaw Gawiejnowicz,et al.  Pareto and scalar bicriterion optimization in scheduling deteriorating jobs , 2006, Comput. Oper. Res..

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

[11]  Sushil K. Gupta,et al.  Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem , 1990 .

[12]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

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

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

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

[16]  Gur Mosheiov,et al.  Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine , 1995 .

[17]  Costas P. Pappis,et al.  Scheduling fire-fighting tasks using the concept of deteriorating jobs , 2006 .

[18]  Chris N. Potts,et al.  Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation , 2008, J. Sched..

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

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

[21]  Chelliah Sriskandarajah,et al.  Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time , 1989 .

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