Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine.
Zhaohui LiuT. C. Edwin ChengPublished in: Theor. Comput. Sci. (2005)
Keyphrases
- release dates
- approximation schemes
- parallel machine scheduling problem
- single machine
- parallel machines
- completion times
- sequence dependent setup times
- single machine scheduling problem
- scheduling problem
- processing times
- approximation algorithms
- precedence constraints
- flowshop
- batch processing
- maximum lateness
- scheduling jobs
- release times
- total weighted tardiness
- np hard
- setup times
- numerical methods
- identical machines
- strongly np hard
- special case
- branch and bound algorithm
- holding cost
- resource consumption
- dynamic programming
- bin packing
- parallel computing
- lot sizing
- search algorithm
- infinite horizon
- identical parallel machines
- combinatorial optimization