Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness.
Zhongjun TianC. T. NgT. C. Edwin ChengPublished in: Oper. Res. Lett. (2009)
Keyphrases
- single machine to minimize
- total tardiness
- processing times
- single machine
- preemptive scheduling
- scheduling problem
- setup times
- flowshop
- parallel machines
- number of late jobs
- single machine scheduling problem
- release times
- scheduling jobs
- precedence constraints
- sequence dependent setup times
- release dates
- identical machines
- dynamic programming
- evolutionary algorithm
- learning effect
- multistage
- response time