The complexity of machine scheduling for stability with a single disrupted job

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.status: publishe