An application of metaheuristic optimization algorithms for solving the flexible job-shop scheduling problem
Abstract. The Flexible Job Planning (FJSP) problem is another planning and scheduling problem. It is a continuation of the classic problem of scheduling jobs, where each operation can be performed on different machines, while the processing time depends on the machine being used. FJSP is a difficul...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Regional Association for Security and crisis management, Belgrade, Serbia
2020-09-01
|
| Series: | Operational Research in Engineering Sciences: Theory and Applications |
| Subjects: | |
| Online Access: | https://oresta.rabek.org/index.php/oresta/article/view/57 |