IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v35y2023i3d10.1007_s10696-022-09453-y.html
   My bibliography  Save this article

Concurrent scheduling of jobs and AGVs in a flexible job shop system: a parallel hybrid PSO-GA meta-heuristic

Author

Listed:
  • Arash Amirteimoori

    (London School of Economics and Political Science (LSE))

  • Reza Kia

    (Birmingham City University)

Abstract

This research proposes a novel mixed integer linear programming (MILP) model along with a Parallel Hybrid PSO-GA Algorithm (PPSOGA) to address the simultaneous scheduling of jobs and Automated Guided Vehicles (AGVs) in a flexible job shop system. Wherein, finite multiple AGVs, alternative process routes, and job re-entry are considered. To the best of our knowledge, no study in the literature has highlighted the efficacy of parallel computing in the simultaneous scheduling of jobs and transporters in a flexible job shop system which remarkably reduces run-time. For this purpose, the suggested meta-heuristic is designed to be compatible with parallel computing and is compared against a number of well-known meta-heuristics (i.e., Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization) on a set of 40 benchmark instances generated using a combination of different distributions (i.e., uniform, exponential, and normal distributions). Employing two Tukey tests, the run-time means and the objective value means of all the suggested meta-heuristics are examined and compared against one another, the results of which emphasizes the superiority of the PPSOGA over all the other solution approaches in terms of the objective function’s value and run-time. Finally, it is discovered that even the sequential mode of the PPSOGA (i.e., the PSOGA) produces better objective values compared to other meta-heuristics.

Suggested Citation

  • Arash Amirteimoori & Reza Kia, 2023. "Concurrent scheduling of jobs and AGVs in a flexible job shop system: a parallel hybrid PSO-GA meta-heuristic," Flexible Services and Manufacturing Journal, Springer, vol. 35(3), pages 727-753, September.
    • Handle: RePEc:spr:flsman:v:35:y:2023:i:3:d:10.1007_s10696-022-09453-y
    DOI: 10.1007/s10696-022-09453-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-022-09453-y
    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/s10696-022-09453-y?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. Hurink, Johann & Knust, Sigrid, 2005. "Tabu search algorithms for job-shop problems with a single transport robot," European Journal of Operational Research, Elsevier, vol. 162(1), pages 99-111, April.
    2. Caumond, A. & Lacomme, P. & Moukrim, A. & Tchernev, N., 2009. "An MILP for scheduling problems in an FMS with one vehicle," European Journal of Operational Research, Elsevier, vol. 199(3), pages 706-722, December.
    3. De Giovanni, L. & Pezzella, F., 2010. "An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem," European Journal of Operational Research, Elsevier, vol. 200(2), pages 395-408, January.
    4. Ümit Bilge & Gündüz Ulusoy, 1995. "A Time Window Approach to Simultaneous Scheduling of Machines and Material Handling System in an FMS," Operations Research, INFORMS, vol. 43(6), pages 1058-1070, December.
    5. Joseph Adams & Egon Balas & Daniel Zawack, 1988. "The Shifting Bottleneck Procedure for Job Shop Scheduling," Management Science, INFORMS, vol. 34(3), pages 391-401, March.
    6. Peter J. M. van Laarhoven & Emile H. L. Aarts & Jan Karel Lenstra, 1992. "Job Shop Scheduling by Simulated Annealing," Operations Research, INFORMS, vol. 40(1), pages 113-125, February.
    7. Lacomme, Philippe & Larabi, Mohand & Tchernev, Nikolay, 2013. "Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles," International Journal of Production Economics, Elsevier, vol. 143(1), pages 24-34.
    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. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    2. Olatunde T. Baruwa & Miquel A. Piera, 2016. "A coloured Petri net-based hybrid heuristic search approach to simultaneous scheduling of machines and automated guided vehicles," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4773-4792, August.
    3. Berterottière, Lucas & Dauzère-Pérès, Stéphane & Yugma, Claude, 2024. "Flexible job-shop scheduling with transportation resources," European Journal of Operational Research, Elsevier, vol. 312(3), pages 890-909.
    4. Yiyi Xu & M’hammed Sahnoun & Fouad Ben Abdelaziz & David Baudry, 2022. "A simulated multi-objective model for flexible job shop transportation scheduling," Annals of Operations Research, Springer, vol. 311(2), pages 899-920, April.
    5. Dalila B. M. M. Fontes & Seyed Mahdi Homayouni, 2019. "Joint production and transportation scheduling in flexible manufacturing systems," Journal of Global Optimization, Springer, vol. 74(4), pages 879-908, August.
    6. Philippe Lacomme & Aziz Moukrim & Alain Quilliot & Marina Vinot, 2019. "Integration of routing into a resource-constrained project scheduling problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(4), pages 421-464, December.
    7. Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.
    8. Fontes, Dalila B.M.M. & Homayouni, S. Mahdi & Gonçalves, José F., 2023. "A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1140-1157.
    9. Lacomme, Philippe & Larabi, Mohand & Tchernev, Nikolay, 2013. "Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles," International Journal of Production Economics, Elsevier, vol. 143(1), pages 24-34.
    10. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    11. Quang-Vinh Dang & Cong Thanh Nguyen & Hana Rudová, 2019. "Scheduling of mobile robots for transportation and manufacturing tasks," Journal of Heuristics, Springer, vol. 25(2), pages 175-213, April.
    12. Edzard Weber & Anselm Tiefenbacher & Norbert Gronau, 2019. "Need for Standardization and Systematization of Test Data for Job-Shop Scheduling," Data, MDPI, vol. 4(1), pages 1-21, February.
    13. Selcuk Goren & Ihsan Sabuncuoglu & Utku Koc, 2012. "Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(1), pages 26-38, February.
    14. T. C. E. Cheng & Bo Peng & Zhipeng Lü, 2016. "A hybrid evolutionary algorithm to solve the job shop scheduling problem," Annals of Operations Research, Springer, vol. 242(2), pages 223-237, July.
    15. Andy Ham, 2020. "Transfer-robot task scheduling in flexible job shop," Journal of Intelligent Manufacturing, Springer, vol. 31(7), pages 1783-1793, October.
    16. Ramesh Bollapragada & Norman M. Sadeh, 2004. "Proactive release procedures for just‐in‐time job shop environments, subject to machine failures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(7), pages 1018-1044, October.
    17. James T. Lin & Chun-Chih Chiu & Edward Huang & Hung-Ming Chen, 2018. "A Multi-Fidelity Model Approach for Simultaneous Scheduling of Machines and Vehicles in Flexible Manufacturing Systems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(01), pages 1-20, February.
    18. Min Dai & Ziwei Zhang & Adriana Giret & Miguel A. Salido, 2019. "An Enhanced Estimation of Distribution Algorithm for Energy-Efficient Job-Shop Scheduling Problems with Transportation Constraints," Sustainability, MDPI, vol. 11(11), pages 1-23, May.
    19. P Corry & E Kozan, 2004. "Job scheduling with technical constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 160-169, February.
    20. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.

    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:flsman:v:35:y:2023:i:3:d:10.1007_s10696-022-09453-y. 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.