Parallel machine scheduling under uncertainty
F. van der Meer (TU Delft - Electrical Engineering, Mathematics and Computer Science)
K.S. Postek – Mentor (TU Delft - Discrete Mathematics and Optimization)
B. van den Dries – Mentor (TU Delft - Analysis)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
This report investigates a scheduling problem where task duration is uncertain. The duration per task has a lower and upper bound, and is dependent on observed duration of other tasks. This tries to closer model real life. We reduce all possible different outcomes to a few extreme scenarios. The report compares two types of heuristcs: one which always chooses the longest duration task first, and one which tries to minimize the uncertainty by choosing tasks that reveal the most information. In the end, we find that the heuristic choosing the longest duration task first competes fairly well with the other type of heuristics.