Semi-online scheduling on two identical machines with a common due date to maximize total early work.
Xin ChenSergey KovalevYuqing LiuMalgorzata SternaIsabelle ChalamonJacek BlazewiczPublished in: Discret. Appl. Math. (2021)
Keyphrases
- identical machines
- processing times
- scheduling problem
- job scheduling
- single machine
- precedence constraints
- online learning
- scheduling jobs
- polynomial time approximation
- completion times
- np hard
- scheduling algorithm
- approximation algorithms
- setup times
- np complete
- resource allocation
- linear programming
- parallel machines
- single machine scheduling problem