- Tytuł:
- Due window assignment and scheduling on parallel machines: a FPTAS for a bottleneck criterion
- Autorzy:
-
Janiak, A.
Janiak, W.
Kovalyov, M. Y. - Powiązania:
- https://bibliotekanauki.pl/articles/200522.pdf
- Data publikacji:
- 2014
- Wydawca:
- Polska Akademia Nauk. Czytelnia Czasopism PAN
- Tematy:
-
fully polynomial time approximation scheme
scheduling
due window assignment
aproksymacja wielomianem
schemat
planowanie
okno przypisania - Opis:
- A fully polynomial time approximation scheme (FPTAS) with run time 0(nm/ εm-1) is developed for a problem which combines common due window assignment and scheduling n jobs on m identical parallel machines. The problem criterion is bottleneck (min-max) such that the maximum cost, which includes job earliness, job tardiness and due window size costs, is minimized.
- Źródło:
-
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 4; 805-808
0239-7528 - Pojawia się w:
- Bulletin of the Polish Academy of Sciences. Technical Sciences
- Dostawca treści:
- Biblioteka Nauki
Artykuł