A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem
Abstract The flexible job shop scheduling problem (FJSP) is considered as an important problem in the modern manufacturing system. It is known to be an NP-hard problem. Most of the algorithms used in solving FJSP problem are categorized as metaheuristic methods. Some of these methods normally consum...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2019-03-01
|
| Series: | Chinese Journal of Mechanical Engineering |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s10033-019-0337-7 |