On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
C. T. NgT. C. Edwin ChengJinjiang YuanZhaohui LiuPublished in: Oper. Res. Lett. (2003)
Keyphrases
- release dates
- scheduling problem
- minimize total
- single machine
- precedence constraints
- processing times
- single machine scheduling problem
- flowshop
- sequence dependent setup times
- setup times
- maximum lateness
- total weighted tardiness
- makespan minimization
- scheduling jobs
- earliness tardiness
- release times
- np hard
- tabu search
- parallel machines
- polynomially solvable
- resource consumption
- job processing times
- job shop scheduling problem
- identical machines
- multistage
- worst case
- genetic algorithm