Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach

A zero-one 0-1 linear programming formulation of multiproject and job-shop scheduling problems is presented that is more general and computationally tractable than other known formulations. It can accommodate a wide range of real-world situations including multiple resource constraints, due dates, job splitting, resource, substitutability, and concurrency and nonconcurrency of job performance requirements. Three possible objective functions are discussed; minimizing total throughput time for all projects: minimizing the time by which all projects are completed i.e., minimizing makespan; and minimizing total lateness or lateness penalty for all projects.

[1]  F. Glover.  A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[2]  S. Lambourn,et al.  Resource allocation and multi-project scheduling (RAMPS) - a new tool in planning and control , 1963, Computer/law journal.

[3]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[4]  Clifford C. Petersen,et al.  Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects , 1967 .

[5]  Jerome D. Wiest.  Some Properties of Schedules for Large Projects with Limited Resources , 1964 .

[6]  Joe Henry Mize,et al.  A HEURISTIC SCHEDULING MODEL FOR MULTI-PROJECT ORGANIZATIONS. (VOLUMES I AND II). , 1964 .

[7]  Richard D. Smith,et al.  A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop , 1967, Oper. Res..

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

[9]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

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

[11]  A. Alan B. Pritsker,et al.  A ZERO-ONE PROGRAMMING APPROACH TO SCHEDULING WITH LIMITED RESOURCES, , 1968 .

[12]  F. S. Hillier.  Chance-constrained programming with 0-1 or bounded decision variables , 1966 .

[13]  A. Alan B. Pritsker,et al.  Mathematical Formulation: A Problem in Design , 1968 .

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

[15]  James G. Root.  Scheduling with Deadlines and Loss Functions on k Parallel Machines , 1965 .

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

[17]  E. H. Bowman.  THE SCHEDULE-SEQUENCING PROBLEM* , 1959 .

[18]  Eugene L. Lawler.  On Scheduling Problems with Deferral Costs , 1964 .

[19]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

[20]  Alan S. Manne,et al.  On the Job-Shop Scheduling Problem , 1960 .