The one-machine just-in-time scheduling problem with preemption.
Yann HendelNina RungeFrancis SourdPublished in: Discret. Optim. (2009)
Keyphrases
- scheduling problem
- parallel machines
- flowshop
- minimizing total tardiness
- minimizing makespan
- sequence dependent setup times
- unrelated parallel machines
- completion times
- single machine
- parallel machine scheduling problem
- batch processing
- setup times
- precedence constraints
- np hard
- earliness tardiness
- total tardiness
- total weighted tardiness
- processing times
- strongly np hard
- tabu search
- release dates
- maximum lateness
- permutation flowshop
- scheduling jobs
- objective function
- single server
- job shop scheduling problem
- quay crane