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ę "parallel machines" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Algorithms Using List Scheduling and Greedy Strategies for Scheduling in the Flowshop with Resource Constraints
    Autorzy:
    Figielska, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/91270.pdf
    Data publikacji:
    2014
    Wydawca:
    Warszawska Wyższa Szkoła Informatyki
    Tematy:
    flowshop
    parallel machines
    resource constraints
    scheduling
    heuristic
    Opis:
    The paper addresses the problem of scheduling in the two-stage flowshop with parallel unrelated machines and renewable resource constraints. The objective is minimization of makespan. The problem is NP-hard. Fast heuristic algorithms using list scheduling and greedy strategies are proposed. For evaluation of the performance of the algorithms computational experiments are performed on randomly generated test problems, and results are reported.
    Źródło:
    Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki; 2014, 8, 11; 29-39
    1896-396X
    2082-8349
    Pojawia się w:
    Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Development of Mechanism with Hybrid Kinematic Structure Prototype
    Autorzy:
    Poppeová, V.
    Uríček, J.
    Bulej, V.
    Šindler, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/971211.pdf
    Data publikacji:
    2009
    Wydawca:
    Wrocławska Rada Federacji Stowarzyszeń Naukowo-Technicznych
    Tematy:
    parallel kinematic structure
    hybrid kinematic structures
    parallel kinematic machines
    parallel kinematic robots
    Opis:
    This paper deals with the development of mechanism with hybrid kinematic structure called trivariant and its subsystems. Hybrid machines are characterized by connecting advantages of both type mechanisms together - high dynamics of parallel mechanisms for positioning and high flexibility and high mobility range of serial mechanisms for orientation. At our department was built the small-scale mechanism prototype used for testing, functional verification, for education and training. There was created the simulation software and control system based on standard PC for this prototype. Our prototype can be applied like small CNC milling machine but it is possible to modify it also for the manipulation with objects like robot device.
    Źródło:
    Journal of Machine Engineering; 2009, 9, 3; 102-109
    1895-7595
    2391-8071
    Pojawia się w:
    Journal of Machine Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Linear programming & metaheuristic approach for scheduling in the hybrid flowshop with resource constraints
    Autorzy:
    Figielska, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/206283.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    flowshop
    parallel machines
    resource constraints
    heuristics
    linear programming
    genetic algorithms
    simulated annealing
    tabu search
    Opis:
    This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and additional renewable resources. The objective is the minimization of makespan. The problem is NP-hard. Heuristic algorithms are proposed which join the linear programming based procedures with metaheuristic algorithms: genetic, simulated annealing and tabu search algorithm. The performance of the proposed algorithms is experimentally evaluated by comparing the solutions with a lower bound on the optimal makespan. Results of a computational experiment show that these algorithms are able to produce good solutions in short computation time and that the metaheuristics significantly improve the results for the most difficult problems.
    Źródło:
    Control and Cybernetics; 2011, 40, 4; 1209-1230
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Heuristic algorithms for preemptive scheduling in a Two-stage flowshop with unrelated parallel machines and 0-1 resource requirements
    Autorzy:
    Figielska, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/969665.pdf
    Data publikacji:
    2009
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    preemptive scheduling
    flowshop
    parallel unrelated machines
    resource constraints
    heuristics
    Opis:
    The paper considers the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines at the first stage and a single machine at the second stage. At the first stage, jobs use some additional renewable resources which are available in limited quantities. The resource requirements are of 0-1 type. The objective is minimization of the makespan. The problem is NP-hard. We develop heuristic algorithms which first solve the problem occurring at stage 1, and then find a final schedule in the flowshop. An extensive computational experiment shows that the proposed heuristic algorithms can be an efficient tool capable of finding good quality solutions.
    Źródło:
    Control and Cybernetics; 2009, 38, 3; 723-743
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An Accurate and Robust Genetic Algorithm to Minimize the Total Tardiness in Parallel Machine Scheduling Problems
    Autorzy:
    Ramadan, Saleem Zeyad
    Almasarwah, Najat
    Abdelall, Esraa S.
    Suer, Gursel A.
    Albashabsheh, Nibal T.
    Powiązania:
    https://bibliotekanauki.pl/articles/27324201.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    identical parallel machines
    accurate generic algorithm
    robust generic algorithm
    immigration
    surrogate fitness function
    vegetative reproduction
    Opis:
    This paper uses a Genetic Algorithm (GA) to reduce total tardiness in an identical parallel machine scheduling problem. The proposed GA is a crossover-free (vegetative reproduction) GA but used for four types of mutations (Two Genes Exchange mutation, Number of Jobs mutation, Flip Ends mutation, and Flip Middle mutation) to make the required balance between the exploration and exploitation functions of the crossover and mutation operators. The results showed that use of these strategies positively affects the accuracy and robustness of the proposed GA in minimizing the total tardiness. The results of the proposed GA are compared to the mathematical model in terms of the time required to tackle the proposed problem. The findings illustrate the ability of the propounded GA to acquire the results in a short time compared to the mathematical model. On the other hand, increasing the number of machines degraded the performance of the proposed GA.
    Źródło:
    Management and Production Engineering Review; 2023, 14, 4; 28--40
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      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