Accession Number : ADA185498

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

Descriptive Note : Technical rept.,

Corporate Author : MICHIGAN UNIV ANN ARBOR DEPT OF INDUSTRIAL AND OPERATIONS ENGINEERING

Personal Author(s) : Bean, James C ; Birge, John R ; Mittenthal, John ; Noon, Charles E

PDF Url : ADA185498

Report Date : Jul 1987

Pagination or Media Count : 27

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.

Descriptors :   *JOB SHOP SCHEDULING, INTEGER PROGRAMMING, MACHINES, RELIABILITY, STATICS, OPTIMIZATION, STRATEGY, FORTRAN

Subject Categories : Administration and Management
      Operations Research
      Mfg & Industrial Eng & Control of Product Sys

Distribution Statement : APPROVED FOR PUBLIC RELEASE