Matchup scheduling with multiple resources, release dates and disruptions
Operations Research
Scheduling of project networks by job assignment
Management Science
One-machine rescheduling heuristics with efficiency and stability as criteria
Computers and Operations Research
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Dynamic rescheduling that simultaneously considers efficiency and stability
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
When it is worthwhile to work with the stochastic RCPSP?
Journal of Scheduling
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
The complexity of machine scheduling for stability with a single disrupted job
Operations Research Letters
| Hi-index | 0.01 |
This paper presents a model for single-machine scheduling with stability objective and a common deadline. Job durations are uncertain, and our goal is to ensure that there is little deviation between planned and actual job starting times. We propose two meta-heuristics for solving an approximate formulation of the model that assumes that exactly one job is disrupted during schedule execution, and we also present a meta-heuristic for the global problem with independent job durations.