Setting planned leadtimes in serial production systems with tardiness costs
Management Science
Discrete optimization
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
Scheduling independent tasks to reduce mean finishing time
Communications of the ACM
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review
Operations Research
Dynamic rescheduling that simultaneously considers efficiency and stability
Computers and Industrial Engineering
Faster maximum and minimum mean cycle algorithms for system-performance analysis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
The complexity of machine scheduling for stability with a single disrupted job
Operations Research Letters
Meta-heuristics for stable scheduling on a single machine
Computers and Operations Research
An anticipative scheduling approach with controllable processing times
Computers and Operations Research
Parallel machine match-up scheduling with manufacturing cost considerations
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
Integrated production scheduling and maintenance policy for robustness in a single machine
Computers and Operations Research
| Hi-index | 0.00 |
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-and-bound algorithm for solving an approximate formulation of the model. The algorithm is exact when exactly one job is disrupted during schedule execution.