Sequencing and scheduling: algorithms and complexity

Sequencing and scheduling as a research area is motivated by questions that arise in production planning, in computer control, and generally in all situations in which scarce resources have to be allocated to activities over time. In this survey, we concentrate on the area of deterministic machine scheduling. We review complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops. We also pay attention to two extensions of this area: resource-constrained project scheduling and stochastic machine scheduling.

[1]  L. G. Mitten.  Sequencing n Jobs on Two Machines with Arbitrary Time Lags , 1959 .

[2]  Michael Pinedo,et al.  Optimal policies in stochastic shop scheduling , 1984, Ann. Oper. Res..

[3]  Michael Pinedo,et al.  Stochastic Shop Scheduling: A Survey , 1982 .

[4]  W. Maxwell.  On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs , 1970 .

[5]  Ronald L. Graham,et al.  Performance Guarantees for Scheduling Algorithms , 1978, Oper. Res..

[6]  Selmer Martin Johnson,et al.  Discussion: Sequencing n Jobs on Two Machines with Arbitrary Time Lags , 1959 .

[7]  A.H.G. Rinnooy Kan,et al.  Single‐machine scheduling subject to stochastic breakdowns , 1990 .

[8]  James R. Jackson,et al.  An extension of Johnson's results on job IDT scheduling , 1956 .

[9]  Jeffrey M. Jaffe,et al.  Efficient Scheduling of Tasks without Full Use of Processor Resources , 1980, Theor. Comput. Sci..

[10]  J. M. Tamarit,et al.  Project scheduling with resource constraints: A branch and bound approach , 1987 .

[11]  Edward G. Coffman,et al.  Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems , 1970, JACM.

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

[13]  Esther Frostig,et al.  A Stochastic Scheduling Problem with Intree Precedence Constraints , 1988, Oper. Res..

[14]  Harold N. Gabow,et al.  Scheduling UET Systems on Two Uniform Processors and Length Two Pipelines , 1988, SIAM J. Comput..

[15]  Edward G. Coffman,et al.  On the Expected Relative Performance of List Scheduling , 1985, Oper. Res..

[16]  M. T. Kaufman,et al.  An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem , 1974, IEEE Transactions on Computers.

[17]  Jane W.-S. Liu,et al.  Bounds on Scheduling Algorithms for Heterogeneous Comnputing Systems , 1974, IFIP Congress.

[18]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[19]  Charles U. Martel,et al.  Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs , 1989, Oper. Res..

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

[21]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[22]  Jeremy P. Spinrad,et al.  Incremental modular decomposition , 1989, JACM.

[23]  Jeffrey M. Jaffe.  An Analysis of Preemptive Multiprocessor Job Scheduling , 1980, Math. Oper. Res..

[24]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[25]  M. Garey,et al.  Minimizing expected makespans on uniform processor systems , 1987, Advances in Applied Probability.

[26]  Shimon Even,et al.  Bounds for the Optimal Scheduling of n Jobs on m Processors , 1964 .

[27]  Jan Karel Lenstra,et al.  Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .

[28]  Edward P. C. Kao,et al.  On Dynamic Programming Methods for Assembly Line Balancing , 1982, Oper. Res..

[29]  Richard Loulou,et al.  Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling , 1984, Math. Oper. Res..

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

[31]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

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

[33]  I. Meilijson,et al.  Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time , 1984, Oper. Res..

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

[35]  Michael Pinedo,et al.  Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints , 1984 .

[36]  Michael Pinedo,et al.  The "Largest Variance First" Policy in Some Stochastic Scheduling Problems , 1987, Oper. Res..

[37]  Michael A. Langston,et al.  Bounds for Multifit Scheduling on Uniform Processors , 1983, SIAM J. Comput..

[38]  J. Erschler,et al.  Applying new dominance concepts to job schedule optimization , 1982 .

[39]  Seiki Kyan,et al.  DETERMINISTIC SCHEDULING IN COMPUTER SYSTEMS: A SURVEY , 1988 .

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

[41]  E. Nowicki,et al.  A note on minimizing maximum lateness in a one-machine sequencing problem with release dates , 1986 .

[42]  Rolf H. Möhring,et al.  Scheduling project networks with resource constraints and time windows , 1988 .

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

[44]  E. L. Lawler,et al.  Computing Maximal "Polymatroidal" Network Flows , 1982, Math. Oper. Res..

[45]  T. S. Abdul-Razaq,et al.  Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .

[46]  Mihalis Yannakakis,et al.  Towards an architecture-independent analysis of parallel algorithms , 1990, STOC '88.

[47]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[48]  Jeffrey B. Sidney,et al.  A Decomposition Algorithm for Sequencing with General Precedence Constraints , 1981, Math. Oper. Res..

[49]  Joseph Y.-T. Leung,et al.  Bin Packing with Restricted Piece Sizes , 1989, Inf. Process. Lett..

[50]  Tibor Fiala.  An Algorithm for the Open-Shop Problem , 1983, Math. Oper. Res..

[51]  L. Gelders,et al.  Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory , 2015, Oper. Res..

[52]  Oscar H. Ibarra,et al.  Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..

[53]  J. Lenstra,et al.  Job-Shop Scheduling by Implicit Enumeration , 1977 .

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

[55]  Greg N. Frederickson,et al.  Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan , 1981, JACM.

[56]  J. Piehler,et al.  Ein Beitrag zum Reihenfolgeproblem , 1960, Unternehmensforschung.

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

[58]  C. Y. Liu,et al.  On the complexity of preemptive open-shop scheduling problems , 1985 .

[59]  Jerzy Kyparisis,et al.  Single machine scheduling research , 1987 .

[60]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[61]  Chris N. Potts,et al.  An algorithm for single machine sequencing with release dates to minimize total weighted completion time , 1983, Discret. Appl. Math..

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

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

[64]  Gideon Weiss,et al.  Multiserver Stochastic Scheduling , 1982 .

[65]  L. V. Wassenhove,et al.  Algorithms for scheduling a single machine to minimize the weighted number of late jobs , 1988 .

[66]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[67]  Sartaj Sahni,et al.  Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops , 1981, Oper. Res..

[68]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

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

[70]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

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

[72]  G. S. Lueker,et al.  Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics , 1988 .

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

[74]  E. L. Lawler,et al.  A fully polynomial approximation scheme for the total tardiness problem , 1982, Oper. Res. Lett..

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

[76]  Francis Y. L. Chin,et al.  On J-maximal and J-minimal Flow-Shop Schedules , 1981, JACM.

[77]  J. K. Lenstra,et al.  Combinatorial optimization : annotated bibliographies , 1985 .

[78]  Rolf H. Möhring,et al.  Computationally Tractable Classes of Ordered Sets , 1989 .

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

[80]  T.C.E. Cheng,et al.  Survey of scheduling research involving due date determination decisions , 1989 .

[81]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[82]  Rolf H. Möhring,et al.  Introduction to Stochastic Scheduling Problems , 1985 .

[83]  Michael Pinedo,et al.  On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking , 1986, Math. Oper. Res..

[84]  J. J. Brennan,et al.  An Improved Algorithm for Scheduling Jobs on Identical Machines , 1977 .

[85]  Lucio Bianco,et al.  Scheduling of a single machine to minimize total weighted completion time subject to release dates , 1982 .

[86]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

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

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

[89]  Michael H. Rothkopf,et al.  Scheduling Independent Tasks on Parallel Processors , 1966 .

[90]  Shui Lam,et al.  A Level Algorithm for Preemptive Scheduling , 1977, J. ACM.

[91]  Gideon Weiss,et al.  Stochastic scheduling problems II-set strategies- , 1985, Z. Oper. Research.

[92]  Imre Bárány,et al.  A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees , 1981, Math. Oper. Res..

[93]  J. Blaswicz.  Selected topics in scheduling theory , 1987 .

[94]  Ram Mohan V. Rachamadugu,et al.  Technical Note - A Note on the Weighted Tardiness Problem , 1987, Oper. Res..

[95]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

[96]  C. N. Potts,et al.  Analysis of a linear programming heuristic for scheduling unrelated parallel machines , 1985, Discret. Appl. Math..

[97]  P Dileepan,et al.  Bicriterion static scheduling research for a single machine , 1988 .

[98]  Chris N. Potts,et al.  An adaptive branching rule for the permutation flow-shop problem , 1980 .

[99]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[100]  C. N. Potts,et al.  An algorithm for the single machine sequencing problem with precedence constraints , 1980 .

[101]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[102]  Manfred Kunde,et al.  First fit decreasing scheduling on uniform multiprocessors , 1985, Discret. Appl. Math..

[103]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[104]  Pierre N. Robillard,et al.  Scheduling with earliest start and due date constraints on multiple machines , 1975 .

[105]  Teofilo F. Gonzalez,et al.  Optimal Preemptive Scheduling of Two Unrelated Processors , 1990, INFORMS J. Comput..

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

[107]  J. Walrand,et al.  Individually optimal routing in parallel systems , 1985 .

[108]  Rolf H. Möhring,et al.  Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time , 1984, Oper. Res..

[109]  Thom J. Hodgson,et al.  Note---A Note on Single Machine Sequencing with Random Processing Times , 1977 .

[110]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[111]  Linus Schrage,et al.  Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..

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

[113]  Eugene Levner,et al.  Fast approximation algorithm for job sequencing with deadlines , 1981, Discret. Appl. Math..

[114]  Michael A. Langston,et al.  Evaluation of a MULTIFIT-Based Scheduling Algorithm , 1986, J. Algorithms.

[115]  Seiki Kyan,et al.  Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem , 1986, SIAM J. Comput..

[116]  John M. Charlton,et al.  A Generalized Machine-Scheduling Algorithm , 1970 .

[117]  Donald K. Friesen,et al.  Tighter Bounds for LPT Scheduling on Uniform Processors , 1987, SIAM J. Comput..

[118]  Ravi Sethi,et al.  On the Complexity of Mean Flow Time Scheduling , 1977, Math. Oper. Res..

[119]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

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

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

[122]  E. L. Lawler,et al.  Recent Results in the Theory of Machine Scheduling , 1982, ISMP.

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

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

[125]  Francis Y. L. Chin,et al.  Scheduling the Open Shop to Minimize Mean Flow Time , 1982, SIAM J. Comput..

[126]  Clyde L. Monma,et al.  Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions , 1987, Math. Oper. Res..

[127]  Rolf H. Möhring,et al.  A Fast Algorithm for the Decomposition of Graphs and Posets , 1983, Math. Oper. Res..

[128]  Robert L. Bulfin,et al.  Scheduling a Single Machine to Minimize the Weighted Number of Tardy Jobs , 1983 .

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

[130]  Oscar H. Ibarra,et al.  Approximation Algorithms for Certain Scheduling Problems , 1978, Math. Oper. Res..

[131]  F G Forst.  A REVIEW OF THE STATIC STOCHASTIC SEQUENCING LITERATURE , 1973 .

[132]  Edward G. Coffman,et al.  Optimal Preemptive Scheduling on Two-Processor Systems , 1969, IEEE Transactions on Computers.

[133]  Danny Dolev,et al.  Scheduling Precedence Graphs of Bounded Height , 1984, J. Algorithms.

[134]  Clyde L. Monma.  The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions , 1979, Oper. Res..

[135]  R. A. Blau.  N-Job, One Machine Sequencing Problems Under Uncertainty , 1973 .

[136]  Jeffrey B. Sidney,et al.  An Extension of Moore’s Due Date Algotithm , 1973 .

[137]  Gregory Dobson,et al.  Scheduling Independent Tasks on Uniform Processors , 1984, SIAM J. Comput..

[138]  R. Möhring.  Scheduling Problems with a Singular Solution , 1982 .

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

[140]  Kenneth Alan Pasch,et al.  Heuristics for job-shop scheduling , 1988 .

[141]  B. J. Lageweg,et al.  A General Bounding Scheme for the Permutation Flow-Shop Problem , 1978, Oper. Res..

[142]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[143]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[144]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[145]  SahniSartaj,et al.  Scheduling Independent Tasks with Due Times on a Uniform Processor System , 1980 .

[146]  Eugene L. Lawler,et al.  Minimizing Maximum Lateness in a Two-Machine Open Shop , 1979, Math. Oper. Res..

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

[148]  J. B. G. Frenk,et al.  The rate of convergence to optimality of the LPT rule , 1986, Discret. Appl. Math..

[149]  Jeffrey M. Jaffe,et al.  Algorithms for Scheduling Tasks on Unrelated Processors , 1981, JACM.

[150]  Gideon Weiss,et al.  Stochastic scheduling problems I — General strategies , 1984, Z. Oper. Research.

[151]  C. Monma,et al.  A concise survey of efficiently solvable special cases of the permutation flow-shop problem , 1983 .

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

[153]  Michael Pinedo,et al.  Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines , 1985, Oper. Res..

[154]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[155]  Ludo Gelders,et al.  Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II - Computation and Structure , 1975, Oper. Res..

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

[157]  G. Weiss,et al.  Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines , 1989, Probability in the Engineering and Informational Sciences.

[158]  Victor J. Rayward-Smith,et al.  The Complexity of Preemptive Scheduling Given Interprocessor Communication Delays , 1987, Inf. Process. Lett..

[159]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

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

[161]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[162]  David B. Shmoys,et al.  A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1986, FSTTCS.

[163]  Sartaj Sahni,et al.  Nearly On Line Scheduling of a Uniform Processor System with Release Times , 1979, SIAM J. Comput..

[164]  J. B. G. Frenk,et al.  The Asymptotic Optimality of the LPT Rule , 1987, Math. Oper. Res..

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

[166]  George Steiner,et al.  Optimal Sequencing by Modular Decomposition: Polynomial Algorithms , 1986, Oper. Res..

[167]  Mark M. Klein,et al.  Scheduling project networks , 1967, CACM.

[168]  Wlodzimierz Szwarc.  On some sequencing problems , 1968 .

[169]  Michael Pinedo,et al.  Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions , 1980, Journal of Applied Probability.

[170]  C. L. Liu,et al.  On a Class of Scheduling Algorithms for Multiprocessors Computing Systems , 1974, Sagamore Computer Conference.

[171]  T RheeW,et al.  First Fit Decreasingアルゴリズムの完全収束 , 1989 .

[172]  Marc E. Posner,et al.  Minimizing Weighted Completion Times with Deadlines , 1985, Oper. Res..

[173]  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).

[174]  S. S. Panwalkar,et al.  Flowshop sequencing problem with ordered processing time matrices: A general case , 1976 .

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

[176]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

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

[178]  Joseph Y.-T. Leung,et al.  Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time , 1991, Inf. Comput..

[179]  Pedro G. Gazmuri.  Probabilistic Analysis of a Machine Scheduling Problem , 1985, Math. Oper. Res..

[180]  E. L. Lawler.  Efficient implementation of dynamic programming algorithms for sequencing problems : (preprint) , 1979 .

[181]  Sartaj Sahni,et al.  Bounds for List Schedules on Uniform Processors , 1980, SIAM J. Comput..

[182]  Salah E. Elmaghraby,et al.  On the Scheduling of Jobs on a Number of Identical Machines. , 1972 .

[183]  C. N. Potts.  Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates , 1985, Math. Oper. Res..

[184]  J. Grabowski.  A New Algorithm of Solving the Flow — Shop Problem , 1982 .

[185]  Teofilo F. Gonzalez,et al.  A Note on Open Shop Preemptive Schedules , 1979, IEEE Transactions on Computers.

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

[187]  I. Adiri,et al.  An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem , 1982, Math. Oper. Res..

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

[189]  William L. Maxwell,et al.  Single machine sequencing with random processing times and random due-dates† , 1969 .

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

[191]  Joseph Y.-T. Leung,et al.  Scheduling Tree-Structured Tasks with Restricted Execution Times , 1988, Inf. Process. Lett..

[192]  Francis Y. L. Chin,et al.  Bounds on Schedules for Independent Tasks with Similar Execution Times , 1981, JACM.

[193]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[194]  Jeffrey R. Barker,et al.  Scheduling the General Job-Shop , 1985 .

[195]  Sartaj Sahni,et al.  Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..

[196]  C. Potts.  A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time , 1985 .

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

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

[199]  Edward W. Davis,et al.  Project Scheduling under Resource Constraints—Historical Review and Categorization of Procedures , 1973 .

[200]  S. L. van deVelde.  Minimizing total completion time in the two-machine flow shop by Langrangian relaxation , 1988 .

[201]  Oscar H. Ibarra,et al.  On Two—Processor Scheduling of One— or Two—Unit Time Tasks with Precedence Constraints , 1975 .

[202]  Joseph Y.-T. Leung,et al.  Minimizing Mean Flow Time with Release Time Constraint , 1990, Theor. Comput. Sci..

[203]  L. V. Wassenhove,et al.  An algorithm for single machine sequencing with deadlines to minimize total weighted completion time , 1983 .

[204]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[205]  Edward G. Coffman,et al.  Expected Makespans for Largest-First Multiprocessor Scheduling , 1984, Performance.

[206]  Michael Pinedo.  A note on the two machine job shop with exponential processing times , 1981 .

[207]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on a Single Machine with Precedence Constraints , 1990, INFORMS J. Comput..

[208]  A.H.G. Rinnooy Kan,et al.  New directions in scheduling theory , 1984 .

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

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

[211]  John L. Bruno,et al.  Probabilistic Bounds on the Performance of List Scheduling , 1986, SIAM J. Comput..

[212]  Toshihide Ibaraki,et al.  A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..

[213]  B. J. Lageweg,et al.  Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

[214]  J. Erschler,et al.  A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates , 1983, Oper. Res..

[215]  Ravi Sethi,et al.  Scheduling Graphs on Two Processors , 1976, SIAM J. Comput..

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

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

[218]  Teofilo F. Gonzalez,et al.  Unit Execution Time Shop Problems , 1982, Math. Oper. Res..

[219]  Rhonda Righter,et al.  Job scheduling to minimize expected weighted flowtime on uniform processors , 1988 .

[220]  Matteo Fischetti,et al.  Worst-case analysis of the differencing method for the partition problem , 1987, Math. Program..

[221]  R. Foley,et al.  Scheduling n nonoverlapping jobs and two stochastic jobs in a flow shop , 1986 .

[222]  Shui Lam,et al.  Worst Case Analysis of Two Scheduling Algorithms , 1977, SIAM J. Comput..

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

[224]  Victor J. Rayward-Smith,et al.  UET scheduling with unit interprocessor communication delays , 1987, Discret. Appl. Math..

[225]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[226]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[227]  D. A. Wismer,et al.  Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[228]  C. V. Ramamoorthy,et al.  On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .

[229]  J. Walrand,et al.  Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime , 1986, Journal of Applied Probability.

[230]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

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

[232]  O. J. Boxma,et al.  Minimizing the expected weighted number of tardy jobs in stochastic flow shops , 1986 .

[233]  Richard M. Karp,et al.  The Differencing Method of Set Partitioning , 1983 .

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

[235]  Donald K. Friesen,et al.  Tighter Bounds for the Multifit Processor Scheduling Algorithm , 1984, SIAM J. Comput..

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

[237]  Teofilo F. Gonzalez,et al.  Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.

[238]  C. Potts,et al.  Algorithms for two-machine flow-shop sequencing with precedence constraints , 1984 .

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

[240]  Michael Pinedo,et al.  A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair , 1988, Probability in the Engineering and Informational Sciences.

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

[242]  Manfred Kunde,et al.  Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems , 1981, SIAM J. Comput..

[243]  Dan Gusfield,et al.  Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines , 1984, J. Algorithms.

[244]  Marshall L. Fisher,et al.  Analysis of a linearization heuristic for single-machine scheduling to maximize profit , 1984, Math. Program..

[245]  Gerd Finke,et al.  New trends in machine scheduling , 1988 .

[246]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.