Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time.
C. T. NgT. C. Edwin ChengAdam JaniakMikhail Y. KovalyovPublished in: Ann. Oper. Res. (2005)
Keyphrases
- processing times
- number of tardy jobs
- scheduling problem
- completion times
- single machine
- release dates
- identical machines
- identical parallel machines
- scheduling jobs
- precedence relations
- single machine scheduling problem
- setup times
- flowshop
- release times
- polynomially solvable
- maximum lateness
- worst case performance ratio
- total weighted tardiness
- resource consumption
- makespan minimization
- sequence dependent setup times
- communication delays
- job processing times
- np hard
- scheduling decisions
- precedence constraints
- search algorithm
- production scheduling
- job shop scheduling problem
- np complete