Header menu link for other important links
X
Scheduling of unrelated parallel machines when machine availability is specified
Vakkalanka Gowri Suresh
Published in
1996
Volume: 7
   
Issue: 4
Pages: 393 - 400
Abstract
Scheduling problems typically assume uninterrupted availability of machines such that jobs can be processed at any time during this uninterrupted period. However, this assumption is seldom valid in reality. For a variety of reasons, e.g. machine adjustments, shift changes, planned maintenance, etc. machines are available only at specified times. The duration for which the machine is not available is known as the vacation. This paper considers the problem of scheduling jobs on unrelated parallel machines when machine vacations are specified. Two cases are considered, first, when the machine vacations are known a priori, and the second, when these constraints are not known a priori. Algorithms have been developed for both models, and computational results are also reported. Kuwait. © 1996 Taylor & Francis Ltd.
About the journal
JournalProduction Planning and Control
ISSN09537287
Open AccessNo
Concepts (17)
  •  related image
    Algorithms
  •  related image
    Availability
  •  related image
    Maintenance
  •  related image
    Mathematical models
  •  related image
    Operations research
  •  related image
    Probability
  •  related image
    Scheduling
  •  related image
    ADJUSTMENTS
  •  related image
    Dynamic environment
  •  related image
    JOBS
  •  related image
    Machine scheduling
  •  related image
    Preventive maintenance
  •  related image
    SHIFT CHANGES
  •  related image
    UNINTERRUPTED PERIOD
  •  related image
    UNRELATED PARALLEL MACHINES
  •  related image
    VACATIONS
  •  related image
    Production control