Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work
[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] employee
2017
scientific article
english
- scheduling
- parallel machines
- early work
- late work
- polynomial time approximation scheme
02.08.2017
927 - 944
CC BY (attribution alone)
open journal
final published version
in press
35
35
1,234