An Improved Ant Colony Optimization for Flexible Job Shop Scheduling Problem
- 10.2991/eia-17.2017.5How to use a DOI?
- flexible job shop scheduling problem; makespan; improved ant colony optimization
This paper deals with the flexible job shop scheduling problem (FJSP) with the objective of minimizing the makespan. An improved ant colony optimization was proposed to avoid falling into the local optimum and time consuming exist in the basic ant colony optimization (ACO). Computational results show that the proposed improved ant colony optimization algorithm can obtain effective solutions in very short and nearly zero time and is comparable with some other heuristic algorithms and can effectively solve the FJSP.
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Lei WANG AU - Jingcao CAI AU - Zhihu LIU AU - Chaomin LUO PY - 2017/07 DA - 2017/07 TI - An Improved Ant Colony Optimization for Flexible Job Shop Scheduling Problem BT - Proceedings of the 2017 International Conference on Electronic Industry and Automation (EIA 2017) PB - Atlantis Press SP - 20 EP - 23 SN - 1951-6851 UR - https://doi.org/10.2991/eia-17.2017.5 DO - 10.2991/eia-17.2017.5 ID - WANG2017/07 ER -