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

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

0.00 Avg rating0 Votes
Article ID: iaor20052163
Country: Netherlands
Volume: 33
Issue: 2
Start Page Number: 151
End Page Number: 156
Publication Date: Mar 2005
Journal: Operations Research Letters
Authors: ,
Keywords: combinatorial analysis
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.

Reviews

Required fields are marked *. Your email address will not be published.