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


Wyświetlanie 1-2 z 2
Tytuł:
An optimum scheduling method for multi-option product flows through production lineswithout intermediate buffers
Autorzy:
Magiera, Marek
Powiązania:
https://bibliotekanauki.pl/articles/406718.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Flexible Manufacturing Systems
integer programming
linear programming
no-wait scheduling
hybrid flow shop
makespan
decision making
Opis:
The presented method is constructed for optimum scheduling in production lines with parallel machines and without intermediate buffers. The production system simultaneously performs operations on various types of products. Multi-option products were taken into account – products of a given type may differ in terms of details. This allows providing for individual requirements of the customers. The one-level approach to scheduling for multioption products is presented. The integer programming is used in the method – optimum solutions are determined: the shortest schedules for multi-option products. Due to the lack of the intermediate buffers, two possibilities are taken into account: no-wait scheduling, possibility of the machines being blocked by products awaiting further operations. These two types of organizing the flow through the production line were compared using computational experiments, the results of which are presented in the paper.
Źródło:
Management and Production Engineering Review; 2020, 11, 1; 86-94
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimizing the Job Shop Scheduling Problem with a no Wait Constraint by Using the Jaya Algorithm Approach
Autorzy:
Bougloula, Aimade Eddine
Powiązania:
https://bibliotekanauki.pl/articles/24200517.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
scheduling
optimization
scheduling problem
job shop
no-wait problem
Jaya algorithm
Opis:
This work is interested to optimize the job shop scheduling problem with a no wait constraint. This constraint occurs when two consecutive operations in a job must be processed without any waiting time either on or between machines. The no wait job shop scheduling problem is a combinatorial optimization problem. Therefore, the study presented here is focused on solving this problem by proposing strategy for making Jaya algorithm applicable for handling optimization of this type of problems and to find processing sequence that minimizes the makespan (Cmax). Several benchmarks are used to analyze the performance of this algorithm compared to the best-known solutions.
Źródło:
Management and Production Engineering Review; 2023, 14, 3; 148--155
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    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