Scheduling of unrelated parallel machines when machine availability is specified |
| |
Authors: | V SURESH DIPAK GHAUDHURI |
| |
Institution: | 1. Division of Industrial Engineering and Management, Department of Humanities and Social Sciences , Indian Institute of Technology , Madras, 600 036, India;2. Techno Economic Division, Economic Policy and Planning Department , Kuwait Institute for Scientific Research , P.O. Box 24885, Safat, 13109, Kuwait |
| |
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 apriori, and the second, when these constraints are not known apriori. Algorithms have been developed for both models, and computational results are also reported. |
| |
Keywords: | machine scheduling unrelated parallel vacations probabilistic |
|
|