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ę "total completion time" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Minimization of the total completion time for asynchronous transmission in a packet data-transmission system
    Autorzy:
    Piórkowski, A.
    Werewka, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/907757.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    szeregowanie wiadomości
    kolejkowanie komunikatu
    system rozproszony
    system czasu rzeczywistego
    message scheduling
    message queuing
    distributed system
    real-time systems
    Opis:
    The minimization of the total completion time for asynchronous transmission in distributed systems is discussed. Attention is focused on the problem of message scheduling on part of the sender. Messages to be sent form a queue, and the order in which they are to be sent has to be first established. The methods of scheduling messages, which minimize the factor of the total completion time, are presented herein. The message-scheduling problem becomes considerably complicated when the stream of data transmitted between the sender and the receiver is organized into packets. A scheduling rule, according to which the shortest messages (SPT-Shortest Processing Time) are selected as the first to be sent, has been proven to be appropriate for the proposed model. A heuristic algorithm for scheduling messages with real-time constraints is proposed. The performance of the scheduling algorithm is experimentally evaluated. The results of the study show the possibility of improving the total completion time from a few to ten percent, depending on the characteristics of the sender. Thus, the practicability of the method has been proved.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 391-400
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Three-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times
    Autorzy:
    Allahverdi, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/375898.pdf
    Data publikacji:
    2007
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    scheduling
    flowshop
    dominance relations
    bounded processing and setup times
    Opis:
    The three-machine flowshop scheduling problem to minimize total completion time is studied where setup times are treated as separate from processing times. Setup and processing times of all jobs on all machines are unknown variables before the actual occurrence of these times. The lower and upper bounds for setup and processing times of each job on each machine is the only information that is available. In such a scheduling environment, there may not exist a unique schedule that remains optimal for all possible realizations of setup and processing times. Therefore, it is desired to obtain a set of dominating schedules (which dominate all other schedules) if possible. The objective for such a scheduling environment is to reduce the size of dominating schedule set. We obtain global and local dominance relations for a three-machine flowshop scheduling problem. Furthermore, we illustrate the use of dominance relations by numerical examples and conduct computational experiments on randomly generated problems to measure the effectiveness of the developed dominance relations. The computational experiments show that the developed dominance relations are quite helpful in reducing the size of dominating schedules.
    Źródło:
    Decision Making in Manufacturing and Services; 2007, 1, 1-2; 5-23
    1896-8325
    2300-7087
    Pojawia się w:
    Decision Making in Manufacturing and Services
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new optimal algorithm for a time-dependent scheduling problem
    Autorzy:
    Kubale, M.
    Ocetkiewicz, K. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/969669.pdf
    Data publikacji:
    2009
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    scheduling
    single machine
    deteriorating jobs
    total completion time
    algorithms
    Opis:
    In this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs, j1,...,jn, and the processing time pi of the i-th job is given by pi = 1 + biSi, where si is the starting time of the i-th job, i = 1,...n. If all jobs have different and non-zero deterioration rates and bi [wzór], where bmin = min{bi}, then an optimal schedule can be found in O(n log n) time. The conducted computational experiments show that the presented algorithm performs very well even on data not satisfying the assumed constraints.
    Źródło:
    Control and Cybernetics; 2009, 38, 3; 713-721
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Heuristic algorithms for the optimization of total weighted completion time for asynchronous transmission in a packet data transmission system
    Autorzy:
    Piórkowski, A.
    Werewka, J.
    Bielecka, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/206673.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    total weighted completion time
    total cost factor
    optimization
    heuristic algorithms
    packet transmission
    Opis:
    In this paper, the minimization of total weighted completion time (total cost) for asynchronous transmission in distributed systems is discussed. Special attention has been paid to the problem of message scheduling on the sender side. Messages to be sent form a queue, therefore the order in which they are to be sent has to be set. Scheduling algorithms can be chosen to optimize scheduling criteria such as total completion time or total weighted completion time. The message scheduling problem becomes complicated considerably when the transmitted data stream between the sender and the receiver is formed into packets. TheWSPT (Weighted Shortest Processing Time) scheduling rule, which orders messages according to non-decreasing length and weight ratios has been proven to be non-optimal. It has been demonstrated that the problem of minimizing the total weighted completion time is NP-hard. Here, we propose heuristic algorithms for scheduling messages and experimentally evaluate the performance of these scheduling algorithms.
    Źródło:
    Control and Cybernetics; 2014, 43, 4; 507-529
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    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