Title: The complexity of generating robust resource-constrained baseline schedules
Authors: Leus, Roel
Herroelen, Willy
Issue Date: Nov-2002
Publisher: K.U.Leuven
Series Title: FETEW Research Report OR_0250 pages:1-17
Abstract: Robust scheduling aims at the construction of a schedule that is protected against uncertain events. A stable schedule is a robust schedule that will change little when variations in the input parameters arise. Robustness can also be achieved by making the schedule makespan insensitive to variability. In this paper, we describe models for the generation of stable and insensitive baseline schedules for resource-constrained scheduling problems and present results on their complexity status. We start from a project scheduling viewpoint and derive results on machine scheduling sub-problems.
Publication status: published
KU Leuven publication type: IR
Appears in Collections:Research Center for Operations Research and Business Statistics (ORSTAT), Leuven
Research Center for Operations Management, Leuven

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.