Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times.
Fernando Siqueira de AlmeidaMarcelo Seido NaganoPublished in: J. Oper. Res. Soc. (2023)
Keyphrases
- sequence dependent setup times
- flowshop
- scheduling problem
- single machine
- release dates
- single machine scheduling problem
- completion times
- processing times
- total weighted tardiness
- setup times
- maximum lateness
- parallel machines
- precedence constraints
- parallel machine scheduling problem
- strongly np hard
- np hard
- special case
- search algorithm
- lot sizing
- tabu search
- job shop