Autor: Kovalyov, M. Y. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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(n^m/ ε^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ł

Skocz do pozycji: 2.

Tytuł:: Scheduling arbitrary number of malleable tasks on multiprocessor systems
Autorzy:: Barketau, M. S.
Kovalyov, M. Y.
Węglarz, J.
Machowiak, M.
Powiązania:: https://bibliotekanauki.pl/articles/202097.pdf
Data publikacji:: 2014
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: multi-processor scheduling
malleable tasks
makespan
Opis:: The problem of scheduling n tasks in a multiprocessor system with m processors to minimize the makespan is studied. Tasks are malleable, which means that a task can be executed by several processors at a time, its processing speed depends on the number of allocated processors, and a set of processors allocated to the same task can change over time. The processing speed of a task is a strictly increasing function of the number of processors allocated to this task. The earlier studies considered the case n ≤ m. This paper presents results for arbitrary n and m including characterizations of a feasible domain and an optimal solution, polynomial time algorithms for strictly increasing convex and concave processing speed functions, and a combinatorial exponential algorithm for arbitrary strictly increasing functions.
Źródło:: Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 2; 255-261
0239-7528
Pojawia się w:: Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja