The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan.
Q. Q. NongC. T. NgT. C. Edwin ChengPublished in: Oper. Res. Lett. (2008)
Keyphrases
- release dates
- single machine
- scheduling problem
- identical machines
- processing times
- maximum lateness
- parallel machines
- minimize total
- earliness tardiness
- total tardiness
- sequence dependent setup times
- scheduling jobs
- release times
- total weighted tardiness
- flowshop
- single machine scheduling problem
- precedence constraints
- identical parallel machines
- setup times
- np hard
- makespan minimization
- tabu search
- job processing times
- production scheduling
- special case
- competitive ratio
- job shop scheduling problem
- dynamic programming
- job shop
- completion times
- shared memory