Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
Federico Della CroceVincent T'kindtPublished in: Oper. Res. Lett. (2003)
Keyphrases
- scheduling problem
- flowshop
- single machine
- completion times
- unrelated parallel machines
- parallel machines
- lower bound
- minimizing makespan
- job processing times
- processing times
- np hard
- tabu search
- setup times
- strongly np hard
- sequence dependent setup times
- parallel machine scheduling problem
- maximum lateness
- permutation flowshop
- precedence constraints
- total tardiness
- upper bound
- dynamic environments
- worst case
- earliness tardiness
- job shop scheduling problem
- release dates
- total weighted tardiness