505
Views
8
CrossRef citations to date
0
Altmetric
Research Article

A decomposition-based artificial bee colony algorithm for the multi-objective flexible jobshop scheduling problem

ORCID Icon, ORCID Icon, &
Pages 524-538 | Received 05 Mar 2020, Accepted 28 Jan 2021, Published online: 09 Mar 2021

References

  • Bai, J., and H. Liu. 2016. “Multi-Objective Artificial Bee Algorithm Based on Decomposition by PBI Method.” Applied Intelligence 45 (4): 976–991.
  • Brandimarte, P. 1993. “Routing and Scheduling in a Flexible Job Shop by Tabu Search.” Annals of Operations Research 41 (3): 157–183.
  • Cao, Z., L. Zhou, B. Hu, and C. Lin. 2019. “An Adaptive Scheduling Algorithm for Dynamic Jobs for Dealing with the Flexible Job Shop Scheduling Problem.” Business and Information Systems Engineering 61 (3): 299–309.
  • Chiang, T.-C., and H.-J. Lin. 2013. “A Simple and Effective Evolutionary Algorithm for Multiobjective Flexible Job Shop Scheduling.” International Journal of Production Economics 141 (1): 87–98. doi:https://doi.org/10.1016/j.ijpe.2012.03.034.
  • García, S., A. Fernández, J. Luengo, and F. Herrera. 2009. “A Study of Statistical Techniques and Performance Measures for Genetics-Based Machine Learning: Accuracy and Interpretability.” Soft Computing 10 (13): 959–977. doi:https://doi.org/10.1007/s00500-008-0392-y.
  • Gong, G., R. Chiong, Q. Deng, and X. Gong. 2020. “A Hybrid Artificial Bee Colony Algorithm for Flexible Job Shop Scheduling with Worker Flexibility.” International Journal of Production Research 58 (14): 4406–4420. doi:https://doi.org/10.1080/00207543.2019.1653504.
  • Kacem, I., S. Hammadi, and P. Borne. 2002a. “Approach by Localization and Multi-Objective Evolutionary Optimization for Flexible Job-Shop Scheduling Problems.” IEEE Transactions on Systems, Man and Cybernetics 32 (1): 1–13.
  • Kacem, I., S. Hammadi, and P. Borne. 2002b. “Pareto-Optimality Approach for Flexible Job-Shop Scheduling Problems. Hybridization of Evolutionary Algorithms and Fuzzy Logic.” Mathematics and Computers in Simulation 60 (3–5): 245–276. doi:https://doi.org/10.1016/S0378-4754(02)00019-8.
  • Karaboga, D. 2005. “An Idea Based on Honey Bee Swarm for Numerical Optimization.” Technical Report-tr06, Computer Engineering Department, Engineering Faculty, Erciyes University, Kayseri, Turkey, 10pp. http://www.lia.deis.unibo.it/Courses/SistInt/articoli/bee-colony1.pdf.
  • Kefalas, M., M. Olhofer, S. Limmer, M. Emmerich, and A. Apostolidis. 2019. “A Tabu Search-Based Memetic Algorithm for the Multi-Objective Flexible Job Shop Scheduling Problem.” Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion (GECCO 2019 Companion), 1254–1262. New York: Association for Computing Machinery (ACM). doi:https://doi.org/10.1145/3319619.3326817.
  • Khan, I., M. K. Maiti, and K. Basuli. 2020. “Multi-Objective Traveling Salesman Problem: An ABC Approach.” Applied Intelligence 5 (11): 3942–3960.
  • Kubiak, W., Y. Feng, G. Li, S. P. Sethi, and C. Sriskandarajah. 2020. “Efficient Algorithms for Flexible Job Shop Scheduling with Parallel Machines.” Naval Research Logistics (NRL) 67 (4): 272–288.
  • Li, H., and Q. Zhang. 2009. “Multiobjective Optimization Problems with Complicated Pareto Sets, MOEA/D and NSGA-II.” IEEE Transactions on Evolutionary Computation 13 (2): 284–302.
  • Luo, S., C. Liu, L. Zhang, and Y. Fan. 2018. “An Improved Nondominated Sorting Genetic Algorithm-II for Multi-Objective Flexible Job-Shop Scheduling Problem.” In Proceedings of the 2018 IEEE Symposium Series on Computational Intelligence (SSCI), 569–577. Piscataway, NJ: IEEE. doi:https://doi.org/10.1109/SSCI.2018.8628824.
  • Mihoubi, B., B. Bouzouia, and M. Gaham. 2020. “Reactive Scheduling Approach for Solving a Realistic Flexible Job Shop Scheduling Problem.” International Journal of Production Research. 19pp. Advance online publication. doi:https://doi.org/10.1080/00207543.2020.1790686.
  • Nearchou, C. 2018. “Multicriteria Scheduling Optimization Using An Elitist Multiobjective Population Heuristic: The H-NSDE Algorithm.” Journal of Heuristics 24 (6): 817–851.
  • Riquelme, N., C. Von Lücken, and B. Baran. 2015. “Performance Metrics in Multi-Objective Optimization.” In Proceedings of the 2015 Latin American Computing Conference (CLEI) 10 (13): 1–11. Piscataway, NJ: IEEE. doi:https://doi.org/10.1109/CLEI.2015.7360024.
  • Sassi, J., I. Alaya, and M. Tagina. 2020. “Bee-Route: A Bee Algorithm for the Multi-Objective Vehicle Routing Problem.” In Proceedings of the 15th International Conference on Software Technologies (ICSOFT), Vol. 1, 307–318. Setúbal, Portugal: SciTePress. doi:https://doi.org/10.5220/0009831303070318.
  • Shen, L., S. Dauzère-Pérès, and J. S. Neufeld. 2018. “Solving the Flexible Job Shop Scheduling Problem with Sequence-Dependent Setup Times.” European Journal of Operational Research 265 (2): 503–516. doi:https://doi.org/10.1016/j.ejor.2017.08.021.
  • Wang, L., G. Zhou, Y. Xu, and M. Liu. 2012. “An Enhanced Pareto-Based Artificial Bee Colony Algorithm for the Multi-Objective Flexible Job-Shop Scheduling.” The International Journal of Advanced Manufacturing Technology 60 (9–12): 1111–1123.
  • Zhang, B., Q.-K. Pan, L. Gao, X.-Y. Li, L.-L. Meng, and K.-K. Peng. 2019. “A Multiobjective Evolutionary Algorithm Based on Decomposition for Hybrid Flowshop Green Scheduling Problem.” Computers and Industrial Engineering 136: 325–344. doi:https://doi.org/10.1016/j.cie.2019.07.036.
  • Zhao, B., J. Gao, Y. Fu, and J. Zhao. 2019. “A Multi-Strategy Integration Pareto Artificial Bee Colony Algorithm for Flexible Job Shop Scheduling Problems.” Xitong Gongcheng Lilun Yu Shijian/System Engineering Theory and Practice 39 (5): 1225–1235. https://www.researchgate.net/journal/Xitong-Gongcheng-Lilun-yu-Shijian-System-Engineering-Theory-and-Practice-1000-6788.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.