Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download BibTeX

Title

Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work

Authors

[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2017

Published in

Journal of Optimization Theory and Applications

Journal year: 2017 | Journal volume: vol. 174 | Journal number: iss. 3

Article type

scientific article

Publication language

english

Keywords
EN
  • scheduling
  • parallel machines
  • early work
  • late work
  • polynomial time approximation scheme
Date of online publication

02.08.2017

Pages (from - to)

927 - 944

DOI

10.1007/s10957-017-1147-7

License type

CC BY (attribution alone)

Open Access Mode

open journal

Open Access Text Version

final published version

Date of Open Access to the publication

in press

Ministry points / journal

35

Ministry points / journal in years 2017-2021

35

Impact Factor

1,234

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.