Two level heuristic for the resource constrained scheduling problem

A two level heuristic for the resource constrained scheduling problem is presented. This heuristic is based on a combination of priority rules where utilization of resources by the operations, the critical path of operations in a job, and the due dates of the jobs are taken into account. The schedules that this heuristic generates have been compared with small problems for which optimal solutions are available and it is shown that these solutions are generally within 15% of the optimal. Also the polynomial time and space complexity of the heuristic is demonstrated.

[1]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

[2]  James H. Patterson,et al.  A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem , 1984 .

[3]  T. C. E. Cheng,et al.  Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine , 1984 .

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

[5]  Francois Viviers,et al.  A decision support system for job shop scheduling , 1983 .

[6]  Matthew Rosenshine,et al.  Scheduling for a combination of made-to-stock and made-to-order jobs in a job shop , 1983 .

[7]  Edward A. Silver,et al.  New alternatives for computer-scheduling of multi-product plants running batchwise under constraints , 1983 .

[8]  Harish C. Bahl.  Column Generation Based Heuristic Algorithm for Multi-Item Scheduling , 1983 .

[9]  Peter A. Pinto,et al.  Application of a Heuristic Scheduling Rule for a Tyre Testing Department , 1983 .

[10]  F. Brian Talbot,et al.  Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case , 1982 .

[11]  Spyros Economides,et al.  RADIOISOTOPE PRODUCTION SCHEDULING IN A NUCLEAR REACTOR , 1982 .

[12]  A. G. Lockett,et al.  Job shop scheduling heuristics and frequency of scheduling , 1982 .

[13]  I. Kurtulus,et al.  Multi-Project Scheduling: Categorization of Heuristic Rules Performance , 1982 .

[14]  Jwm Will Bertrand,et al.  A comparison of due-date selection rules , 1981 .

[15]  B. R. MacManus,et al.  An approach to optimization with heuristic methods of scheduling , 1980 .

[16]  A. S. Spachis,et al.  Job-shop scheduling heuristics with local neighbourhood search , 1979 .

[17]  James K. Weeks.  A Simulation Study of Predictable Due-Dates , 1979 .

[18]  E. W. Davis,et al.  Multiple Resource–Constrained Scheduling Using Branch and Bound , 1978 .

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

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

[21]  James H. Patterson,et al.  Scheduling a Project Under Multiple Resource Constraints: A Zero-One Programming Approach , 1976 .

[22]  Edward W. Davis,et al.  Project Network Summary Measures Constrained- Resource Scheduling , 1975 .

[23]  James Herbert Patterson,et al.  Alternate Methods of Project Scheduling with Limited Resources , 1973 .

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

[25]  Marshall L. Fisher,et al.  Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..

[26]  Edward W. Davis,et al.  An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints , 1971 .

[27]  Philip M. Wolfe,et al.  Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach , 1969 .

[28]  Robert L. Ferguson,et al.  A Computer Aided Decision System , 1969 .

[29]  J. D. Wiest,et al.  A Heuristic Model for Scheduling Large Projects with Limited Resources , 1967 .

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

[31]  Jack Moshman,et al.  RAMPS: a technique for resource allocation and multi-project scheduling , 1899, AFIPS Spring Joint Computing Conference.

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

[33]  Prabuddha De,et al.  Scheduling to minimize maximum lateness on unequal parallel processors , 1982, Comput. Oper. Res..

[34]  Thomas E. Baker,et al.  A branch and bound network algorithm for interactive process scheduling , 1981 .

[35]  Jacek Ba̵ażewicz,et al.  Solving the resource constrained deadline scheduling problem via reduction to the network flow problem , 1981 .

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

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

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