Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: fully polynomial time approximation scheme

Sortuj według:

Ogranicz wyniki do:

Due window assignment and scheduling on parallel machines: a FPTAS for a bottleneck criterion

Janiak A., Janiak W., Kovalyov M. Y.

Bulletin of the Polish Academy of Sciences. Technical Sciences

2014

Vol. 62, nr 4

805--808

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.