Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work.
Malgorzata SternaKateryna CzerniachowskaPublished in: J. Optim. Theory Appl. (2017)
Keyphrases
- polynomial time approximation
- parallel machines
- makespan minimization
- scheduling problem
- np hard
- identical machines
- unrelated parallel machines
- approximation algorithms
- error bounds
- total tardiness
- sequence dependent setup times
- minimize total
- release dates
- scheduling jobs
- weighted tardiness
- precedence constraints
- flowshop
- parallel computing
- setup times
- lot sizing
- single machine
- bin packing
- lower bound
- optimal solution
- integer programming
- branch and bound algorithm
- identical parallel machines
- branch and bound
- pairwise
- computational complexity
- search algorithm