Chapter 9 Sequencing and scheduling: Algorithms and complexity

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

[2]  L. Stockmeyer.  Chapter 9 Computational complexity , 1992 .

[3]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[4]  J. B. G. Frenk,et al.  A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering , 1991, Probability in the Engineering and Informational Sciences.

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

[6]  S. L. Velde.  Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .

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

[8]  M. Yue.  On the exact upper bound for the multifit processor scheduling algorithm , 1990 .

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

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

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

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

[13]  Gary D. Scudder,et al.  Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

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

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

[16]  I. Adiri,et al.  Open‐shop scheduling problems with dominated machines , 1989 .

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

[18]  Joseph Y.-T. Leung,et al.  Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length , 1989, SIAM J. Discret. Math..

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

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

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

[22]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

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

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

[25]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[26]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

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

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

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

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

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

[32]  Joseph Y.-T. Leung,et al.  Minimizing mean flow time with release time and deadline constraints , 1988, Proceedings. Real-Time Systems Symposium.

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

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

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

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

[37]  S. Sarin,et al.  An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime , 1988 .

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

[39]  David B. Shmoys,et al.  A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1988, SIAM J. Comput..

[40]  Robert E. Tarjan,et al.  One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..

[41]  John F. Morrison,et al.  A note on LPT scheduling , 1988 .

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

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

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

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

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

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

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

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

[50]  Chris N. Potts,et al.  Dynamic programming and decomposition approaches for the single machine total tardiness problem , 1987 .

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

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

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

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

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

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

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

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

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

[60]  Uttarayan Bagchi,et al.  Technical Note - An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines , 1987, Oper. Res..

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

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

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

[64]  Scott Turner,et al.  Comparison of heuristics for flow shop sequencing , 1987 .

[65]  J. Blazewicz,et al.  Selected Topics in Scheduling Theory , 1987 .

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

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

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

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

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

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

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

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

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

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

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

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

[78]  F. Radermacher.  Scheduling of project networks , 1985 .

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

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

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

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

[83]  Manfred K. Warmuth,et al.  Profile Scheduling of Opposing Forests and Level Orders , 1985 .

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

[85]  Danny Dolev,et al.  Scheduling Flat Graphs , 1985, SIAM J. Comput..

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

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

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

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

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

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

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

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

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

[95]  E. Balas.  On the facial structure of scheduling polyhedra , 1985 .

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

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

[98]  Onno J. Boxma,et al.  A Probabilistic Analysis of the LPT Scheduling Rule , 1984, International Symposium on Computer Modeling, Measurement and Evaluation.

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

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

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

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

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

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

[105]  Satish K. Tripathi,et al.  A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors , 1984, IEEE Transactions on Computers.

[106]  Hans Röck,et al.  The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

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

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

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

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

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

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

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

[114]  Hans Röck,et al.  Some new results in flow shop scheduling , 1984, Z. Oper. Research.

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

[116]  J. Grabowski,et al.  On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness , 1983 .

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

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

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

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

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

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

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

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

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

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

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

[128]  Jeffrey B Sidney,et al.  The two machine makespan problem with stochastic flow times , 1983 .

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

[130]  Eugene L. Lawler,et al.  Scheduling a Single Machine to Minimize the Number of Late Jobs , 1983 .

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

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

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

[134]  B. J. Lageweg,et al.  Surrogate duality relaxation for job shop scheduling , 1983, Discret. Appl. Math..

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

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

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

[138]  Francis Y. L. Chin,et al.  Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems , 1982, Math. Oper. Res..

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

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

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

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

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

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

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

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

[147]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

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

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

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

[151]  Michael Pinedo,et al.  Minimizing the Expected Makespan in Stochastic Flow Shops , 1982, Oper. Res..

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

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

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

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

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

[157]  Eugene L. Lawler,et al.  Machine scheduling with precedence con-straints , 1982 .

[158]  P. Brucker.  A linear time algorithm to minimize maximum lateness for the two-machine, unit-time, job-shop, scheduling problem , 1982 .

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

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

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

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

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

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

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

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

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

[168]  Clyde L. Monma,et al.  Sequencing with general precedence constraints , 1981, Discret. Appl. Math..

[169]  Jitender S. Deogun,et al.  Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time , 1981, SIAM J. Comput..

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

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

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

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

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

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

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

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

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

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

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

[181]  Clyde L. Monma,et al.  Sequencing to Minimize the Maximum Job Cost , 1980, Oper. Res..

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

[183]  Christos H. Papadimitriou,et al.  Flowshop scheduling with limited temporary storage , 1980, JACM.

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

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

[186]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

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

[188]  Jan Karel Lenstra,et al.  Complexity results for scheduling chains on a single machine : (preprint) , 1980 .

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

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

[191]  R. Weber.  THE INTERCHANGEABILITY OF -/M/1 QUEUES IN SERIES , 1979 .

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

[193]  Mihalis Yannakakis,et al.  Scheduling Interval-Ordered Tasks , 1979, SIAM J. Comput..

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

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

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

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

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

[199]  E. L. Lawler,et al.  Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs : (preprint) , 1979 .

[200]  A. Trayse,et al.  ALGORITHMS FOR MINIMAL-LENGTH SCHEDULES , 1979 .

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

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

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

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

[205]  James H. Patterson,et al.  An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems , 1978 .

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

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

[208]  Wlodzimierz Szwarc.  Technical Note - Dominance Conditions for the Three-Machine Flow-Shop Problem , 1978, Oper. Res..

[209]  Linus Schrage,et al.  Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks , 1978, Oper. Res..

[210]  Jatinder N. D. Gupta,et al.  Technical Note - Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem , 1978, Oper. Res..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[234]  Jan Karel Lenstra,et al.  Sequencing by enumerative methods , 1977 .

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

[236]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

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

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

[239]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

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

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

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

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

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

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

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

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

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

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

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

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

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

[253]  R. A. Dudek,et al.  Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .

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

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

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

[257]  Kenneth Steiglitz,et al.  Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/ F , 1975, JACM.

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

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

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

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

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

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

[264]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

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

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

[267]  Wlodzimierz Szwarc.  Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem , 1973, Oper. Res..

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

[269]  W. A. Horn.  Technical Note - Minimizing Average Flow Time with Parallel Machines , 1973, Oper. Res..

[270]  M. Florian,et al.  On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem , 1973 .

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

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

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

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

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

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

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

[278]  W. Szwarc.  Elimination methods in the m × n sequencing problem , 1971 .

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

[280]  M. Fujii,et al.  Erratum “Optimal Sequencing of Two Equivalent Processors” , 1971 .

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

[282]  Linus Schrage,et al.  Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case , 1970, Oper. Res..

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

[284]  James E. Day,et al.  Review of sequencing research , 1970 .

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

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

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

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

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

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

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

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

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

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

[295]  Egon Balas,et al.  PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS. , 1968 .

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

[297]  William S. Gere.  Heuristics in Job Shop Scheduling , 1966 .

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

[299]  N. Hsu.  Elementary proof of Hu’s theorem on isotone mappings , 1966 .

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

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

[302]  B. P. Banerjee,et al.  Single Facility Sequencing with Random Execution Times , 1965 .

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

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

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

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

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

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

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

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

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

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

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

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

[315]  J. R. Jackson.  SCHEDULING A PRODUCTION LINE TO MINIMIZE MAXIMUM TARDINESS , 1955 .

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