Fast and efficient algorithms to handle the dynamism in a single machine scheduling problem with sequence-dependent setup times.
Francisco Ángel-BelloJobish VallikavungalAda M. AlvarezPublished in: Comput. Ind. Eng. (2021)
Keyphrases
- single machine scheduling problem
- sequence dependent setup times
- release dates
- total weighted tardiness
- weighted tardiness
- single machine
- setup times
- branch and bound algorithm
- processing times
- scheduling problem
- parallel machines
- precedence constraints
- combinatorial optimization
- flowshop
- hybrid algorithm
- search procedure
- lagrangian relaxation
- resource consumption
- distributed systems
- lot sizing
- query optimization
- search space