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ł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Batch scheduling of deteriorating products
Autorzy:: Barketau, M. S.
Cheng, T. C. E.
Kovalyov, M. Y.
Ng, C. T. D.
Powiązania:: https://bibliotekanauki.pl/articles/375908.pdf
Data publikacji:: 2007
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: scheduling
batching
remanufacturing
deterioration
Opis:: In this paper we consider the problem of scheduling N jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a simple linear increasing function depending on job's waiting time, which is the time between the start of the processing of the batch to which the job belongs and the start of the processing of the job. Each batch starts from the setup time S. Jobs which are assigned to the batch are being prepared for the processing during time S0 < S. After this preparation they are ready to be processed one by one. The non-negative number bi is associated with job i. The processing time of the i-th job is equal to bi(si - (si(b) + S0)), where si(b) and si are the starting time of the b-th batch to which the i-th job belongs and the starting time of this job, respectively. The objective is to minimize the completion time of the last job. We show that the problem is NP-hard. After that we present an O(N) time algorithm solving the problem optimally for the case bi = b. We further present an O(N2) time approximation algorithm with a performance guarantee 2.
Źródło:: Decision Making in Manufacturing and Services; 2007, 1, 1-2; 25-34
1896-8325
2300-7087
Pojawia się w:: Decision Making in Manufacturing and Services
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Kovalyov, M. Y." wg kryterium: Autor

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język