Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times.
Vitor NeselloAnand SubramanianMaria BattarraGilbert LaportePublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- message passing
- exact solution
- single machine scheduling problem
- sequence dependent setup times
- branch and bound algorithm
- lower bound
- release dates
- column generation
- weighted tardiness
- single machine
- total weighted tardiness
- lagrangian relaxation
- processing times
- precedence constraints
- setup times
- approximate solutions
- optimal solution
- scheduling problem
- resource consumption
- branch and bound
- upper bound
- combinatorial optimization
- np hard
- genetic algorithm
- metaheuristic
- worst case
- approximation algorithms
- parallel machines
- search procedure
- flowshop