Methods and Algorithms for Flexible Job Shop Scheduling − A State of the Art
The Job Shop Scheduling Problem (JSSP) attracts many researchers due to its combinatorial nature and its discovery in numerous practical applications. This type of problem is characterized by high computational complexity; therefore, solving large-sized problems is not accessible with exact optimiza...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2025-06-01
|
| Series: | Cybernetics and Information Technologies |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/cait-2025-0009 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|