Title: The complexity of machine scheduling for stability with a single disrupted job
Authors: Leus, Roel ×
Herroelen, Willy #
Issue Date: Mar-2005
Publisher: Elsevier science bv
Series Title: Operations research letters vol:33 issue:2 pages:151-156
Abstract: A stable schedule is a robust schedule that will change little when uncertain events occur. The purpose of this paper is to investigate the complexity status of a number of machine scheduling problems with stability objective, when the duration of a single job is anticipated to be disrupted. (C) 2004 Elsevier B.V. All rights reserved.
ISSN: 0167-6377
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Research Center for Operations Research and Business Statistics (ORSTAT), Leuven
Research Center for Operations Management, Leuven
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
ORL05.pdf Published 198KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


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

© Web of science