Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date.
Xin ChenYage LiangMalgorzata SternaWen WangJacek BlazewiczPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- polynomial time approximation
- makespan minimization
- parallel machines
- np hard
- approximation algorithms
- error bounds
- scheduling problem
- total tardiness
- massively parallel
- precedence constraints
- special case
- parallel computing
- bin packing
- identical machines
- approximation ratio
- approximation guarantees
- lot sizing
- scheduling jobs
- theoretical analysis
- unrelated parallel machines