Flexible Job Shop Scheduling Problem Using an Improved Ant Colony Optimization
As an extension of the classical job shop scheduling problem, the flexible job shop scheduling problem (FJSP) plays an important role in real production systems. In FJSP, an operation is allowed to be processed on more than one alternative machine. It has been proven to be a strongly NP-hard problem...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2017-01-01
|
| Series: | Scientific Programming |
| Online Access: | http://dx.doi.org/10.1155/2017/9016303 |