Article ID: | iaor20133658 |
Volume: | 35 |
Issue: | 3 |
Start Page Number: | 659 |
End Page Number: | 689 |
Publication Date: | Jul 2013 |
Journal: | OR Spectrum |
Authors: | Werner Frank, Lai Tsung-Chyan, Sotskov Yuri |
Keywords: | interval arithmetic, uncertainty |
The paper deals with scheduling under uncertainty of the job processing times. The actual value of the processing time of a job becomes known only when the schedule is executed and may be equal to any value from the given interval. We propose an approach which consists of calculating measures of problem uncertainty to choose an appropriate method for solving an uncertain scheduling problem. These measures are based on the concept of a minimal dominant set containing at least one optimal schedule for each realization of the job processing times. For minimizing the sum of weighted completion times of the