Two approaches to handle the dynamism in a scheduling problem with sequence-dependent setup times.
Francisco Ángel-BelloJobish VallikavungalAda M. AlvarezPublished in: Expert Syst. Appl. (2021)
Keyphrases
- scheduling problem
- sequence dependent setup times
- single machine
- flowshop
- setup times
- parallel machines
- maximum lateness
- precedence constraints
- single machine scheduling problem
- total weighted tardiness
- total tardiness
- release dates
- np hard
- lot sizing
- processing times
- parallel machine scheduling problem
- job shop scheduling problem
- job shop
- worst case
- search space