Article ID Journal Published Year Pages File Type
10524051 Operations Research Letters 2005 6 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The complexity of machine scheduling for stability with a single disrupted job
Authors
, ,