An Effective Heuristic for the No-Wait Flowshop with Sequence-Dependent Setup Times Problem.
Daniella Castro AraújoMarcelo Seido NaganoPublished in: MICAI (1) (2010)
Keyphrases
- sequence dependent setup times
- flowshop
- scheduling problem
- single machine
- tabu search
- single machine scheduling problem
- setup times
- total tardiness
- minimizing total tardiness
- total weighted tardiness
- parallel machines
- maximum lateness
- strongly np hard
- processing times
- special case
- precedence constraints
- lot sizing
- lagrangian relaxation
- minimizing makespan
- job shop scheduling problem
- release dates
- np hard
- setup cost
- metaheuristic
- dynamic programming
- optimal solution
- search procedure
- computational complexity