Match-Up Scheduling with Multiple Resources, Release Dates and Disruptions.

Abstract

This paper considers the rescheduling of operations with release dates and multiple resources when disruptions prevent the use of a preplanned schedule. The overall strategy is to follow the preschedule until a disruption occurs. After a disruption, part of the schedule is reconstructed to matchup with the preschedule at some future time. Conditions are given for the optimality of this approach. A practical implementation is compared with the alternatives of preplanned static scheduling and myopic dynamic scheduling. A set of practical test problems demonstrated the advantages of the matchup approach. We also explore the solution of the matchup scheduling problem and show the advantages of an integer programming approach for allocating resources to jobs. Keywords: Scheduling, Integer Programming, Unreliable Machines.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1987
Accession Number
ADA185498

Entities

People

  • Charles E. Noon
  • James C. Bean
  • John Mittenthal
  • John R. Birge

Organizations

  • University of Michigan

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computations
  • Computer Programming
  • Engineering
  • Industrial Engineering
  • Integer Programming
  • Job Shop Scheduling
  • Manufacturing
  • Mathematics
  • Military Research
  • Operations Research
  • Production
  • Production Control
  • Scheduling (Production)
  • Sequences
  • Universities

Readers

  • Atmospheric Remote Sensing.
  • Computer Networking
  • Operations Research