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ę "dynamic scheduling" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Utilization Balancing Algorithms for Dynamic Multicast Scheduling Problem in EON
    Autorzy:
    Markowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/963830.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    elastic optical networks
    multicast
    load balancing
    flow assignment
    dynamic scheduling
    heuristic algorithms
    Opis:
    Dynamic data transfer demands are often being a challenge for present communication networks, as they appear in unpredictable time and must be satisfied prior to deadline. Important kind are the multi-target demands occurring in task of replication, backup, database synchronization or file transferring in pear-to-pear networks. Optimal scheduling usually depends of the nature of transport network. In the paper dynamic deadlinedriven multicast scheduling problem over elastic optical network is considered. Particularly, the method for improving link utilization by traffic balance for multicast demands is proposed. Few heuristic algorithms and results of experiments, proving the benefits of balancing concept are presented
    Źródło:
    International Journal of Electronics and Telecommunications; 2016, 62, 4; 363-370
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Off-line and dynamic production scheduling - a comparative case study
    Autorzy:
    Bożek, A.
    Wysocki, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/406687.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    flexible job shop
    lot streaming
    off-line scheduling
    dynamic scheduling
    tabu search
    constraint programming
    dispatching rule
    Petri nets
    multi-agent systems
    Opis:
    A comprehensive case study of manufacturing scheduling solutions development is given. It includes highly generalized scheduling problem as well as a few scheduling modes, methods and problem models. The considered problem combines flexible job shop structure, lot streaming with variable sublots, transport times, setup times, and machine calendars. Tabu search metaheuristic and constraint programming methods have been used for the off-line scheduling. Two dynamic scheduling methods have also been implemented, i.e., dispatching rules for the completely reactive scheduling and a multi-agent system for the predictivereactive scheduling. In these implementations three distinct models of the problem have been used, based on: graph representation, optimal constraint satisfaction, and Petri net formalism. Each of these solutions has been verified in computational experiments. The results are compared and some findings about advantages, disadvantages, and suggestions on using the solutions are formulated.
    Źródło:
    Management and Production Engineering Review; 2016, 7, 1; 21-32
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of tasks in an operational production plan in conditions of unit and small batch production
    Autorzy:
    Mleczko, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/117882.pdf
    Data publikacji:
    2008
    Wydawca:
    Polskie Towarzystwo Promocji Wiedzy
    Tematy:
    dynamic classification
    operational production plan
    scheduling
    unit and small batch production
    Opis:
    In conditions of unit and small batch production a very important role is played by time of product availability for the customer. Despite using modern management techniques setup time still play an important role in the production cycle time. In the examined companies the relation between rearmament times to processing times is still high. The above researches inspired the author to prepare the method of setup times’ reduction through proper arrangement of tasks in the operational production plan. Optimization of the daily production plans is based on two-level division of scheduling and arranging tasks. To counterbalance fluctuations and inaccuracy of operational planning it is necessary to introduce the positive feed-back into the system in a form of registering of operations implementation.
    Źródło:
    Applied Computer Science; 2008, 4, 1; 61-79
    1895-3735
    Pojawia się w:
    Applied Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Exact approaches to late work scheduling on unrelated machines
    Autorzy:
    Liu, Xinbo
    Wang, Wen
    Chen, Xin
    Sterna, Malgorzata
    Blazewicz, Jacek
    Powiązania:
    https://bibliotekanauki.pl/articles/11542692.pdf
    Data publikacji:
    2023
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    late work scheduling
    unrelated machine
    mathematical model
    branch algorithm
    bound algorithm
    dynamic programming
    planowanie pracy
    model matematyczny
    algorytm podziału
    algorytm ograniczeń
    programowanie dynamiczne
    Opis:
    We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bounding strategy and on enumerating combined with a dynamic programming algorithm. The time efficiencies of all three approaches are evaluated through computational experiments.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2023, 33, 2; 285--295
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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