Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints.
Eun-Seok KimChang Sup SungIk-Sun LeePublished in: Comput. Oper. Res. (2009)
Keyphrases
- parallel machines
- minimize total
- precedence constraints
- release dates
- scheduling problem
- weighted tardiness
- sequence dependent setup times
- maximum lateness
- total tardiness
- single machine scheduling problem
- setup times
- parallel computing
- shared memory
- single machine
- scheduling jobs
- lot sizing
- flowshop
- branch and bound