Scheduling for stability in single-machine production systems

Abstract

Robust scheduling aims at the construction of a schedule that is protected against uncertain events. A stable schedule is a robust schedule that changes only little when variations in the input parameters arise. This paper presents a model for single-machine scheduling with stability objective and a common deadline. We propose a branch-andbound algorithm for solving an approximate formulation of the model. The algorithm is exact when exactly one job is disrupted during schedule execution.

Meta-heuristics for stable scheduling on a single machine

“…In effect, the baseline starting times become 'release dates' for schedule execution. A motivation for this approach is given in [21]. The realization of D i becomes known when job i is executed; the exact timing of this information is not important since we reschedule by right-shifting the remaining jobs without re-sequencing:…”

“…This was the motivation in [21] to develop a model that focuses only on the main effects of the separate disruption of each of the n jobs rather than on all possible disruption interactions.…”

“…for planning external activities such as material procurement and preventive maintenance), as well as for commitments to customers (delivery dates). The usefulness of a predictive schedule is further discussed in [2,21,24,34].…”

A hybrid algorithm for the robust graph coloring problem

“…Applications in examination timetabling problem, cluster analysis, uncertain resource constraint assignment problems in supply chain management and machine scheduling have been presented in [31,33,21,19]. Mathematical formulations of the RGCP as a binary linear programming problem and quadratic assignment among others are proposed in [31].…”

Parallel machine match-up scheduling with manufacturing cost considerations

“…For the maximum tardiness problem, Jensen (2001) proposed minimizing maximum lateness instead, so that the achieved schedule has improved rescheduling performance due to the idle time left at the end of the schedule. In a recent work, Leus and Herroelen (2007) considered minimizing expected weighted deviation between actual and planned job starting times in a single machine scheduling problem with common deadline for all jobs. They find the optimal job sequence and the optimal length of idle time following each job in the schedule when exactly one job deviates from its expected duration.…”