Minimizing the Maximum Lateness

Hans Kellerer Universität Graz 10.

[1]  David B. Shmoys,et al.  Near-Optimal Sequencing with Precedence Constraints , 1990, IPCO.

[2]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3]  E. Nowicki,et al.  A block approach for single-machine scheduling with release dates and due dates , 1986 .

[4]  Barbara B. Simons,et al.  Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines , 1983, SIAM J. Comput..

[5]  Mohamed Haouari,et al.  Minimizing makespan on parallel machines subject to release dates and delivery times , 2002 .

[6]  Sartaj Sahni,et al.  Scheduling Independent Tasks with Due Times on a Uniform Processor System , 1980, JACM.

[7]  Manfred K. Warmuth,et al.  A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs , 1989, SIAM J. Comput..

[8]  Ellis Horowitz,et al.  Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.

[9]  Charles U. Martel,et al.  Preemptive Scheduling with Release Times, Deadlines, and Due Times , 1982, JACM.

[10]  C. N. Potts,et al.  Technical Note - Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times , 1980, Oper. Res..

[11]  David B. Shmoys,et al.  Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better , 1992, Math. Oper. Res..

[12]  E. L. Lawler,et al.  Preemptive Scheduling of. Precedence-Constrained Jobs on Parallel Machines , 1981 .

[13]  Francis Sourd,et al.  Scheduling with tails and deadlines , 2001 .

[14]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[15]  Jan Karel Lenstra,et al.  Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints , 1983, Oper. Res..

[16]  Graham McMahon,et al.  On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..

[17]  B. J. Lageweg,et al.  Scheduling identical jobs on uniform parallel machines , 1989 .

[18]  R. E. Larson,et al.  A Forward-Backward Procedure for the Single Machine Problem to Minimize Maximum Lateness , 1980 .

[19]  David B. Shmoys,et al.  Approximation schemes for constrained scheduling problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[20]  Stanislaw Zdrzalka,et al.  An algorithm for single machine sequencing with release dates to minimize maximum cost , 1989, Discret. Appl. Math..

[21]  Eugene L. Lawler,et al.  On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming , 1978, JACM.

[22]  B. J. Lageweg,et al.  Minimizing maximum lateness on one machine : Computational experience and some applications , 1976 .

[23]  Kenneth R. Baker,et al.  Sequencing with due-dates and early start times to minimize maximum tardiness , 1974 .

[24]  Greg N. Frederickson,et al.  Scheduling Unit-Time Tasks With Integer Release Times and Deadlines , 1983, Inf. Process. Lett..

[25]  M. Dessouky.  Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness , 1998 .

[26]  Leslie A. Hall.  A Note on Generalizing the Maximum Lateness Criterion for Scheduling , 1993, Discret. Appl. Math..

[27]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

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

[29]  Leslie A. Hall,et al.  Approximation algorithms for scheduling , 1996 .

[30]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[31]  Ron Shamir,et al.  An O(n log2 n) Algorithm for the Maximum Weighted Tardiness Problem , 1989, Inf. Process. Lett..

[32]  Gerhard J. Woeginger,et al.  A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .

[33]  Mohamed Haouari,et al.  An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines , 2003, Oper. Res. Lett..

[34]  Eugeniusz Nowicki,et al.  An Approximation Algorithm for a Single-Machine Scheduling Problem with Release Times and Delivery Times , 1994, Discret. Appl. Math..

[35]  H. Mine,et al.  PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES , 1979 .

[36]  J. Carlier.  The one-machine sequencing problem , 1982 .

[37]  Teofilo F. Gonzalez,et al.  A New Algorithm for Preemptive Scheduling of Trees , 1980, JACM.

[38]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[39]  Barbara B. Simons,et al.  A fast algorithm for single processor scheduling , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[40]  Gerhard J. Woeginger,et al.  heuristics for parallel machine scheduling with delivery times , 1994, Acta Informatica.

[41]  Greg N. Frederickson,et al.  A Faster Algorithm for the Maximum Weighted Tardiness Problem , 1990, Inf. Process. Lett..

[42]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[43]  Awi Federgruen,et al.  Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques , 1986 .

[44]  G. Tinhofer,et al.  A new lower bound for the makespan of a single machine scheduling problem , 1992 .

[45]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[46]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

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

[48]  Jacques Carlier,et al.  Scheduling jobs with release dates and tails on identical machines to minimize the makespan , 1987 .

[49]  Eric Pinson,et al.  Jackson's Pseudo Preemptive Schedule for the Pm/ri, qi/Cmax scheduling problem , 1998, Ann. Oper. Res..

[50]  Eugene L. Lawler,et al.  Preemptive scheduling of uniform machines subject to release dates : (preprint) , 1979 .

[51]  Robert E. Tarjan,et al.  Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines , 1981, SIAM J. Comput..

[52]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[53]  Sartaj Sahni,et al.  Preemptive Scheduling with Due Dates , 1979, Oper. Res..

[54]  Clyde L. Monma,et al.  Linear-Time Algorithms for Scheduling on Parallel Processors , 1982, Oper. Res..

[55]  Christos Koulamas,et al.  Scheduling on uniform parallel machines to minimize maximum lateness , 2000, Oper. Res. Lett..

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