Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times.
Ansis OzolinsPublished in: Oper. Res. (2020)
Keyphrases
- sequence dependent setup times
- flowshop
- scheduling problem
- single machine
- single machine scheduling problem
- parallel machines
- setup times
- precedence constraints
- release dates
- job shop scheduling problem
- job shop
- lot sizing
- processing times
- tabu search
- special case
- setup cost
- branch and bound algorithm
- lagrangian relaxation
- computational complexity