- 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ł