Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    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ł
    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ł
    Tytuł:
    Internet shopping optimization problem
    Autorzy:
    Błażewicz, J.
    Kovalyov, M. Y.
    Musiał, J.
    Urbański, A. P.
    Wojciechowski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/907755.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    algorytm
    złożoność obliczeniowa
    algorytm kombinatoryczny
    optymalizacja
    zakupy internetowe
    algorithm
    computational complexity
    combinatorial algorithms
    optimization
    Internet shopping
    Opis:
    A high number of Internet shops makes it difficult for a customer to review manually all the available offers and select optimal outlets for shopping. A partial solution to the problem is brought by price comparators which produce price rankings from collected offers. However, their possibilities are limited to a comparison of offers for a single product requested by the customer. The issue we investigate in this paper is a multiple-item multiple-shop optimization problem, in which total expenses of a customer to buy a given set of items should be minimized over all available offers. In this paper, the Internet Shopping Optimization Problem (ISOP) is defined in a formal way and a proof of its strong NP-hardness is provided. We also describe polynomial time algorithms for special cases of the problem.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 385-390
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    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ł
      Wyświetlanie 1-4 z 4

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies