Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity.
Bin FuYumei HuoHairong ZhaoPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- parallel machines
- scheduling problem
- polynomial time approximation
- single machine
- total tardiness
- minimize total
- real time
- sequence dependent setup times
- massively parallel
- unrelated parallel machines
- parallel computing
- stream processing
- precedence constraints
- processing times
- approximation algorithms
- np hard
- release dates
- data processing
- scheduling jobs
- weighted tardiness
- data streams
- lot sizing
- error bounds
- video streaming