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

Authors:
Roel Leus;Willy Herroelen
Affiliations:
Operations Management Group, Department of Applied Economics, Katholieke Universiteit Leuven, Naamsestraat 69, B-3000 Leuven, Belgium;Operations Management Group, Department of Applied Economics, Katholieke Universiteit Leuven, Naamsestraat 69, B-3000 Leuven, Belgium
Venue:
Operations Research Letters
Year:
2005

Citing 8
Cited 8

Single machine flow-time scheduling with a single breakdown

Acta Informatica
Matchup scheduling with multiple resources, release dates and disruptions

Operations Research
One-machine rescheduling heuristics with efficiency and stability as criteria

Computers and Operations Research
Robust scheduling to hedge against processing time uncertainty in single-stage production

Management Science
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Dynamic rescheduling that simultaneously considers efficiency and stability

Computers and Industrial Engineering
Rescheduling for New Orders

Operations Research
Scheduling chain-structured tasks to minimize makespan and mean flow time

Information and Computation

Heuristic procedures for reactive project scheduling

Computers and Industrial Engineering
A classification of predictive-reactive project scheduling procedures

Journal of Scheduling
Scheduling for stability in single-machine production systems

Journal of Scheduling
Meta-heuristics for stable scheduling on a single machine

Computers and Operations Research
Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities

Journal of Scheduling
A survey of dynamic scheduling in manufacturing systems

Journal of Scheduling
Minimizing total weighted flow time under uncertainty using dominance and a stability box

Computers and Operations Research
Minimizing total weighted flow time of a set of jobs with interval processing times

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.