Machine scheduling with precedence con-straints

Machine scheduling theory is concerned with the allocation over time of scarce resources in the form of machines or processors to activities known as jobs or tasks. If the jobs can be performed in any order, they are said to be independent. However, this is often not the case; technological or other constraints may dictate that of two given jobs one must be performed before the other. Such precedence constraints of course impose a partial ordering on the jobs.

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

[2]  B. J. Lageweg,et al.  Computer aided complexity classification of deterministic scheduling problems , 1981 .

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

[4]  Kevin Mahon,et al.  Deterministic and Stochastic Scheduling , 1983 .

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

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

[7]  B. D. Sivazlian,et al.  Minimization of Time-Varying Costs in Single-Machine Scheduling , 1978, Oper. Res..

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

[9]  Jeffrey B. Sidney,et al.  The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations , 1979, Oper. Res..

[10]  Hussein M. Abdel-Wahab,et al.  Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints , 1978, Oper. Res..

[11]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[12]  David S. Johnson,et al.  Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness , 1977, Math. Oper. Res..

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

[14]  W. A. Horn.  Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties , 1972 .

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

[16]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

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

[18]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[19]  David S. Johnson,et al.  Scheduling Opposing Forests , 1983 .

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

[21]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

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

[23]  D. Adolphson.  Optimal linear-ordering. , 1973 .

[24]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

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

[26]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[27]  Clyde L. Monma,et al.  Sequencing with Series-Parallel Precedence Constraints , 1979, Math. Oper. Res..

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

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

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

[31]  David S. Johnson,et al.  Scheduling Tasks with Nonuniform Deadlines on Two Processors , 1976, J. ACM.

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

[33]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[34]  David S. Johnson,et al.  Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..

[35]  Harold N. Gabow,et al.  An Almost-Linear Algorithm for Two-Processor Scheduling , 1982, JACM.

[36]  M. R. Garey,et al.  Optimal task sequencing with precedence constraints , 1973, Discrete Mathematics.

[37]  M. Fujii,et al.  Optimal Sequencing of Two Equivalent Processors , 1969 .

[38]  B. J. Lageweg,et al.  Computer-Aided complexity classification of combinational problems , 1982, CACM.