Informacja

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

Wyszukujesz frazę "flexible job shop scheduling" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
A genetic algorithm-based approach for flexible job shop rescheduling problem with machine failure interference
Autorzy:
Liang, Zhongyuan
Zhong, Peisi
Zhang, Chao
Yang, Wenlei
Xiong, Wei
Yang, Shihao
Meng, Jing
Powiązania:
https://bibliotekanauki.pl/articles/27320976.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
genetic algorithm
rescheduling
machine failure
flexible job shop scheduling
Opis:
Rescheduling is the guarantee to maintain the reliable operation of production system process. In production system, the original scheduling scheme cannot be carried out when machine breaks down. It is necessary to transfer the production tasks in the failure cycle and replan the production path to ensure that the production tasks are completed on time and maintain the stability of production system. To address this issue, in this paper, we studied the event-driven rescheduling policy in dynamic environment, and established the usage rules of right-shift rescheduling and complete rescheduling based on the type of interference events. And then, we proposed the rescheduling decision method based on genetic algorithm for solving flexible job shop scheduling problem with machine fault interference. In addition, we extended the "mk" series of instances by introducing the machine fault interference information. The solution data show that the complete rescheduling method can respond effectively to the rescheduling of flexible job shop scheduling problem with machine failure interference.
Źródło:
Eksploatacja i Niezawodność; 2023, 25, 4; art. no. 171784
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Lower bounds for the scheduling problem with uncertain demands
Autorzy:
Berkoune, D.
Mesghouni, K.
Rabenasolo, B.
Powiązania:
https://bibliotekanauki.pl/articles/908409.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
szeregowanie zadań
prognozowanie popytu
granica dolna
flexible job shop scheduling
insertion
makespan
predicted demands
lower bounds
Opis:
This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem (FJSP). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems (NP-hard). We will use genetic algorithms for the optimisation of this type of problems. The list of the demands is divided in two sets: the actual demand, which is considered as certain (a list of jobs with known characteristics), and the predicted demand, which is a list of uncertain jobs. The actual demand is scheduled in priority by the genetic algorithm. Then, the predicted demand is inserted using various methods in order to generate different scheduling solutions. Two lower bounds are given for the makespan before and after the insertion of the predicted demand. The performance of solutions is evaluated by comparing the real values obtained on many static and dynamic scheduling examples with the corresponding lower bounds.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2006, 16, 2; 263-269
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
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ł
    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