MULTIPROJECT SCHEDULING WITH LIMITED RESOURCES: A ZERO-ONE PROGRAMMING APPROACH

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1968
Accession Number
AD0666412

Entities

People

  • A. Alan B. Pritsker
  • Lawrence J. Watters
  • Philip M. Wolfe

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Availability
  • Buildings And Structures
  • Computer Programming
  • Corporations
  • Integer Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Plastic Explosives
  • Scheduling (Production)
  • Splitting
  • Systems Science
  • Throughput

Fields of Study

  • Computer science

Readers

  • Operations Research