IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i4d10.1007_s10878-025-01296-1.html
   My bibliography  Save this article

A review on the versions of artificial bee colony algorithm for scheduling problems

Author

Listed:
  • Beyza Gorkemli

    (Erciyes University)

  • Ebubekir Kaya

    (Nevsehir Haci Bektas Veli University)

  • Dervis Karaboga

    (Erciyes University)

  • Bahriye Akay

    (Erciyes University)

Abstract

Today, artificial bee colony (ABC) algorithm is one of the most popular swarm intelligence based optimization techniques. Although it was originally introduced to work on continuous space for numerical optimization problems, several researchers also successfully use the ABC for other problem types. In this study, variants of the ABC for scheduling problems are surveyed. Since the scheduling problems are combinatorial type problems, generally some modifications related to the solution representation or neighborhood search operators are introduced in these studies. Additionally, several enhancement ideas are also presented for the ABC algorithm such as the improvements of initialization, employed bee, onlooker bee, scout bee phases and hybrid usage with other metaheuristics or local search methods. This paper evaluates the literature, provides some analyses on its current state and gaps, and addresses possible future works. It is hoped that this review study would be beneficial for the researchers interested in this field.

Suggested Citation

  • Beyza Gorkemli & Ebubekir Kaya & Dervis Karaboga & Bahriye Akay, 2025. "A review on the versions of artificial bee colony algorithm for scheduling problems," Journal of Combinatorial Optimization, Springer, vol. 49(4), pages 1-46, May.
    • Handle: RePEc:spr:jcomop:v:49:y:2025:i:4:d:10.1007_s10878-025-01296-1
    DOI: 10.1007/s10878-025-01296-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01296-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-025-01296-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Alkın Yurtkuran & Erdal Emel, 2016. "A discrete artificial bee colony algorithm for single machine scheduling problems," International Journal of Production Research, Taylor & Francis Journals, vol. 54(22), pages 6860-6878, November.
    2. Haiquan Wang & Lei Liao & Dongyun Wang & Shengjun Wen & Mingcong Deng, 2014. "Improved Artificial Bee Colony Algorithm and Its Application in LQR Controller Optimization," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-8, April.
    3. Jun-qing Li & Shun-Chang Bai & Pei-yong Duan & Hong-yan Sang & Yu-yan Han & Zhi-xin Zheng, 2019. "An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system," International Journal of Production Research, Taylor & Francis Journals, vol. 57(22), pages 6922-6942, November.
    4. Pan, Quan-Ke & Wang, Ling & Li, Jun-Qing & Duan, Jun-Hua, 2014. "A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation," Omega, Elsevier, vol. 45(C), pages 42-56.
    5. Pan, Quan-Ke, 2016. "An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling," European Journal of Operational Research, Elsevier, vol. 250(3), pages 702-714.
    6. Guanlong Deng & Hongyong Yang & Shuning Zhang, 2016. "An Enhanced Discrete Artificial Bee Colony Algorithm to Minimize the Total Flow Time in Permutation Flow Shop Scheduling with Limited Buffers," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-11, July.
    7. Zhang, Rui & Song, Shiji & Wu, Cheng, 2013. "A hybrid artificial bee colony algorithm for the job shop scheduling problem," International Journal of Production Economics, Elsevier, vol. 141(1), pages 167-178.
    8. Wang, Xiuli & Xie, Xingzi & Cheng, T.C.E., 2013. "A modified artificial bee colony algorithm for order acceptance in two-machine flow shops," International Journal of Production Economics, Elsevier, vol. 141(1), pages 14-23.
    9. Tao Meng & Quan-Ke Pan & Hong-Yan Sang, 2018. "A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations," International Journal of Production Research, Taylor & Francis Journals, vol. 56(16), pages 5278-5292, August.
    10. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    11. Guiliang Gong & Raymond Chiong & Qianwang Deng & Xuran Gong, 2020. "A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility," International Journal of Production Research, Taylor & Francis Journals, vol. 58(14), pages 4406-4420, July.
    12. Hua Xuan & Huixian Zhang & Bing Li, 2019. "An Improved Discrete Artificial Bee Colony Algorithm for Flexible Flowshop Scheduling with Step Deteriorating Jobs and Sequence-Dependent Setup Times," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-13, December.
    13. Jorge García Álvarez & Miguel Ángel González & Camino Rodríguez Vela & Ramiro Varela, 2018. "Electric Vehicle Charging Scheduling by an Enhanced Artificial Bee Colony Algorithm," Energies, MDPI, vol. 11(10), pages 1-19, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    2. Mei Li & Gai-Ge Wang & Helong Yu, 2021. "Sorting-Based Discrete Artificial Bee Colony Algorithm for Solving Fuzzy Hybrid Flow Shop Green Scheduling Problem," Mathematics, MDPI, vol. 9(18), pages 1-30, September.
    3. Zhi Li & Ray Y. Zhong & Ali Vatankhah Barenji & J. J. Liu & C. X. Yu & George Q. Huang, 2021. "Bi-objective hybrid flow shop scheduling with common due date," Operational Research, Springer, vol. 21(2), pages 1153-1178, June.
    4. Dayong Han & Qiuhua Tang & Zikai Zhang & Zixiang Li, 2020. "An Improved Migrating Birds Optimization Algorithm for a Hybrid Flow Shop Scheduling within Steel Plants," Mathematics, MDPI, vol. 8(10), pages 1-28, September.
    5. Mohamadreza Dabiri & Mehdi Yazdani & Bahman Naderi & Hassan Haleh, 2022. "Modeling and solution methods for hybrid flow shop scheduling problem with job rejection," Operational Research, Springer, vol. 22(3), pages 2721-2765, July.
    6. Wang, Xiuli & Cheng, T.C.E., 2015. "A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint," International Journal of Production Economics, Elsevier, vol. 161(C), pages 74-82.
    7. Riya Kakkar & Rajesh Gupta & Smita Agrawal & Sudeep Tanwar & Ahmed Altameem & Torki Altameem & Ravi Sharma & Florin-Emilian Turcanu & Maria Simona Raboaca, 2022. "Blockchain and IoT-Driven Optimized Consensus Mechanism for Electric Vehicle Scheduling at Charging Stations," Sustainability, MDPI, vol. 14(19), pages 1-20, October.
    8. Wang, Xiuli & Zhu, Qianqian & Cheng, T.C.E., 2015. "Subcontracting price schemes for order acceptance and scheduling," Omega, Elsevier, vol. 54(C), pages 1-10.
    9. Yong Wang & Yuting Wang & Yuyan Han, 2023. "A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem," Mathematics, MDPI, vol. 11(11), pages 1-25, May.
    10. Bierwirth, C. & Kuhpfahl, J., 2017. "Extended GRASP for the job shop scheduling problem with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 261(3), pages 835-848.
    11. Liang Tang & Zhihong Jin & Xuwei Qin & Ke Jing, 2019. "Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design," Annals of Operations Research, Springer, vol. 275(2), pages 685-714, April.
    12. Zhengyu Hu & Wenrui Liu & Shengchen Ling & Kuan Fan, 2021. "Research on multi-objective optimal scheduling considering the balance of labor workload distribution," PLOS ONE, Public Library of Science, vol. 16(8), pages 1-15, August.
    13. Hosseinzadeh, Aryan & Algomaiah, Majeed & Kluger, Robert & Li, Zhixia, 2021. "Spatial analysis of shared e-scooter trips," Journal of Transport Geography, Elsevier, vol. 92(C).
    14. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    15. Tarhan, İstenç & Oğuz, Ceyda, 2022. "A matheuristic for the generalized order acceptance and scheduling problem," European Journal of Operational Research, Elsevier, vol. 299(1), pages 87-103.
    16. Hasani, Ali & Hosseini, Seyed Mohammad Hassan, 2020. "A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: Trade-off between production costs and energy consumption," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    17. Pieter Moerloose & Broos Maenhout, 2023. "A two-stage local search heuristic for solving the steelmaking continuous casting scheduling problem with dual shared-resource and blocking constraints," Operational Research, Springer, vol. 23(1), pages 1-43, March.
    18. Shoujing Zhang & Tiantian Hou & Qing Qu & Adam Glowacz & Samar M. Alqhtani & Muhammad Irfan & Grzegorz Królczyk & Zhixiong Li, 2022. "An Improved Mayfly Method to Solve Distributed Flexible Job Shop Scheduling Problem under Dual Resource Constraints," Sustainability, MDPI, vol. 14(19), pages 1-19, September.
    19. Jiajun Zhou & Xifan Yao, 2017. "A hybrid approach combining modified artificial bee colony and cuckoo search algorithms for multi-objective cloud manufacturing service composition," International Journal of Production Research, Taylor & Francis Journals, vol. 55(16), pages 4765-4784, August.
    20. Cui, Yibing & Hu, Wei & Rahmani, Ahmed, 2023. "Fractional-order artificial bee colony algorithm with application in robot path planning," European Journal of Operational Research, Elsevier, vol. 306(1), pages 47-64.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:49:y:2025:i:4:d:10.1007_s10878-025-01296-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.