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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    Tytuł:
    Application of Johnson’s algorithm in processing jobs through two-machine system
    Autorzy:
    Okwu, Modestus
    Emovon, Ikuobase
    Powiązania:
    https://bibliotekanauki.pl/articles/95167.pdf
    Data publikacji:
    2020
    Wydawca:
    Politechnika Koszalińska. Wydawnictwo Uczelniane
    Tematy:
    Johnson algorithm
    heuristic technique
    sequencing
    scheduling
    algorytm Johnsona
    heurystyka
    sekwencjonowanie
    planowanie
    Opis:
    The purpose of this research is to effectively schedule jobs in a production company using heuristic Johnson’s algorithm. A popular pure water production factory, Iterlene industrial services limited (IISL) located at Effurun, Nigeria was investigated and it was noticed that different sizes of jobs (bottled water) are produced ranging from 25 cl, 50 cl, 60 cl, 75 cl, and 150 cl respectively, which are processed through the filling machine (FM1) and capping machine (CM2). In the order FM1CM2. Each job has to pass through the same sequence of operations. Jobs are assigned in such a way that a job is assigned on FM1 first and once processing is completed on FM1, it is assigned to CM2 and passing is not allowed. The idle time for the production of 500 bottles of water was estimated to be 1020 seconds (17.00 mins.). Johnson’s algorithm was applied to minimize the idle time for both FM1 and CM2 by determining the optimal sequence of the processed jobs. This was achieved within 780 seconds (13.00 mins.). Conclusively, the minimization of total elapsed time between the completion of first and last job was achieved. This would greatly improve productivity, effectiveness, and profitability at iterlene factory.
    Źródło:
    Journal of Mechanical and Energy Engineering; 2020, 4, 1; 33-38
    2544-0780
    2544-1671
    Pojawia się w:
    Journal of Mechanical and Energy Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    LCS Approach to Tasks Scheduling Problem in the Two Processor System
    Autorzy:
    Wasielewska, K.
    Seredyński, F.
    Powiązania:
    https://bibliotekanauki.pl/articles/92950.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
    Tematy:
    learning classifier systems
    scheduling problem
    evolutionary technique
    Opis:
    In this paper we propose an approach to solve multiprocessor scheduling problem with use of rule-based learning machine - Learning Classifier System (LCS). LCS combines reinforcement learning and evolutionary computing to produce adaptive systems. We interpret the multiprocessor scheduling problem as multi-step problem, where a feedback is given after some number steps. We show that LCS is able to solve scheduling tasks of a parallel program in the two processor system.
    Źródło:
    Studia Informatica : systems and information technology; 2007, 2(9); 29-39
    1731-2264
    Pojawia się w:
    Studia Informatica : systems and information technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Scheduling technique of route vehicles on duplicating stretches
    Autorzy:
    Azemsha, Siarhei
    Kravchenya, Irina
    Vovk, Yuriy
    Lyashuk, Oleg
    Vovk, Iryna
    Powiązania:
    https://bibliotekanauki.pl/articles/2091243.pdf
    Data publikacji:
    2021
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    scheduling technique
    route vehicle
    duplicating stretches
    technika harmonogramowania
    pojazd użytkowy
    powielanie odcinków
    Opis:
    Schedule optimization is a proven strategy to improve service quality for public transport networks. However, current research mostly optimizes schedule design using prior knowledge of users’ routings, ignoring the optimization of public transport schedules on duplicating stretches of route vehicles. This article presents a new alignment technique of time intervals between consecutive vehicles of different routes on duplicating stretches, considering existing public transport networks in attaining optimization of public transport schedule. Scheduling technique of route vehicles on duplicating stretches includes some steps: analysis of public transport network and determining a lot of duplicating stretches, calculation of the optimal time intervals among arrivals of route vehicles and alignment of these intervals among consecutive route vehicles on duplicating stretches, realization simulation model of urban passenger transport within the simulation modeling system of GPSS World. Furthermore, testing the optimization technique of route vehicle scheduling, analysis of the quality of adjusted schedule with route vehicles of different kinds included, and determining the optimization efficiency for duplicating stretches. The adjusting technique of urban passenger transport schedule allows to increase movement steadiness of consecutive vehicles of different routes on duplicating stretches, adjust traffic intervals for each route, shorten the traffic load on stations, reducing idle time and queue lengths of route vehicles in front of transport stops and also minimize waiting time for route vehicle by those passengers who can be transported along several routes. Improving the bus schedule on duplicating stretches in Gomel is illustrated demonstrating the technique developed. This scheduling technique can be used by carriers and transport operators to improve the quality of services provided.
    Źródło:
    Zeszyty Naukowe. Transport / Politechnika Śląska; 2021, 113; 5--16
    0209-3324
    2450-1549
    Pojawia się w:
    Zeszyty Naukowe. Transport / Politechnika Śląska
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-3 z 3

      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