Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times.
Rajesh SwaminathanMichele E. PfundJohn W. FowlerScott J. MasonAhmet B. KehaPublished in: Comput. Oper. Res. (2007)
Keyphrases
- total weighted tardiness
- processing times
- single machine
- scheduling problem
- makespan minimization
- single machine scheduling problem
- release dates
- lagrangian relaxation
- completion times
- sequence dependent setup times
- flowshop
- parallel machines
- polynomially solvable
- job shop scheduling problem
- job shop
- setup times
- dynamic programming
- np hard
- column generation
- optimal solution
- job shop scheduling
- search algorithm