A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times.
Mateus Rocha de PaulaGeraldo Robson MateusMartín Gómez RavettiPublished in: Comput. Oper. Res. (2010)
Keyphrases
- parallel machines
- sequence dependent setup times
- scheduling problem
- single machine scheduling problem
- total weighted tardiness
- makespan minimization
- processing times
- single machine
- setup times
- release dates
- weighted tardiness
- total tardiness
- precedence constraints
- dynamic programming
- flowshop
- np hard
- maximum lateness
- minimize total
- computational complexity
- strongly np hard
- objective function
- worst case
- lower and upper bounds
- parallel computing
- solution quality
- linear programming
- supply chain
- upper bound
- search space
- bayesian networks