IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v16y2025i3d10.1007_s13198-025-02714-7.html
   My bibliography  Save this article

Optimisation of job shop scheduling problem using genetic algorithm and simulated annealing: a case study of manufacturing industry

Author

Listed:
  • Rakesh Kumar Phanden

    (Federation University Australia
    Sat Kabir Institute of Technology & Management
    Institute of Health & Management
    Amity University Uttar Pradesh)

  • Shrajal Gupta

    (Jagan Institute of Management Studies)

  • Biruk Wolde

    (Arba Minch University)

  • Ravinder Kumar

    (Amity University Uttar Pradesh)

  • Ayon Chakraborty

    (Federation University Australia)

Abstract

Production scheduling is an important activity within the manufacturing system to improve its performance. It is a process of assigning resources to the task or vice versa, which depends upon the configuration of the shop floor and the type of products to be manufactured. In job shops, scheduling is a very complex task since it involves a variety of products to process on a limited number of machines to cut down on the amount of time it takes to do tasks. In the present work, a case study from the manufacturing industry has been taken to maximise the amount of time it takes to do tasks (i.e., makespan) having job shop configuration. Two distinguished nature-inspired algorithms, viz Simulated annealing (SA) and Genetic algorithm (GA), have been pragmatic in optimising the existing schedule. The results show that GA outperform the SA by a 1.76% increment in the makespan value. Also, the GA and SA possessed better results than the company’s existing production schedule by 32.23 and 31.02%, respectively.

Suggested Citation

  • Rakesh Kumar Phanden & Shrajal Gupta & Biruk Wolde & Ravinder Kumar & Ayon Chakraborty, 2025. "Optimisation of job shop scheduling problem using genetic algorithm and simulated annealing: a case study of manufacturing industry," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 16(3), pages 883-892, March.
    • Handle: RePEc:spr:ijsaem:v:16:y:2025:i:3:d:10.1007_s13198-025-02714-7
    DOI: 10.1007/s13198-025-02714-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-025-02714-7
    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/s13198-025-02714-7?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. Young-In Kim & Hyun-Jung Kim, 2021. "Rescheduling of unrelated parallel machines with job-dependent setup times under forecasted machine breakdown," International Journal of Production Research, Taylor & Francis Journals, vol. 59(17), pages 5236-5258, September.
    2. Bezoui, Madani & Olteanu, Alexandru-Liviu & Sevaux, Marc, 2023. "Integrating preferences within multiobjective flexible job shop scheduling," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1079-1086.
    3. Fortemps, Ph. & Ost, Ch. & Pirlot, M. & Teghem, J. & Tuyttens, D., 1996. "Using metaheuristics for solving a production scheduling problem in a chemical firm. A case study," International Journal of Production Economics, Elsevier, vol. 46(1), pages 13-26, December.
    4. Jae-Gon Kim & Seokwoo Song & BongJoo Jeong, 2020. "Minimising total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times," International Journal of Production Research, Taylor & Francis Journals, vol. 58(6), pages 1628-1643, March.
    5. Lei Xu & Qian Wang & Simin Huang, 2015. "Dynamic order acceptance and scheduling problem with sequence-dependent setup time," International Journal of Production Research, Taylor & Francis Journals, vol. 53(19), pages 5797-5808, October.
    6. C. T. Baker & B. P. Dzielinski, 1960. "Simulation of a Simplified Job Shop," Management Science, INFORMS, vol. 6(3), pages 311-323, April.
    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. Dung-Ying Lin & Tzu-Yun Huang, 2021. "A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem," Mathematics, MDPI, vol. 9(7), pages 1-20, April.
    2. Perea, Federico & Yepes-Borrero, Juan C. & Menezes, Mozart B.C., 2023. "Acceptance Ordering Scheduling Problem: The impact of an order-portfolio on a make-to-order firm’s profitability," International Journal of Production Economics, Elsevier, vol. 264(C).
    3. Ristl, Robin & Xi, Dong & Glimm, Ekkehard & Posch, Martin, 2018. "Optimal exact tests for multiple binary endpoints," Computational Statistics & Data Analysis, Elsevier, vol. 122(C), pages 1-17.
    4. Ajay Surendrarao Bhongade & Prakash Manohar Khodke & Ateekh Ur Rehman & Manoj Dattatray Nikam & Prathamesh Dattatray Patil & Pramod Suryavanshi, 2023. "Managing Disruptions in a Flow-Shop Manufacturing System," Mathematics, MDPI, vol. 11(7), pages 1-22, April.
    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. Dauzère-Pérès, Stéphane & Ding, Junwen & Shen, Liji & Tamssaouet, Karim, 2024. "The flexible job shop scheduling problem: A review," European Journal of Operational Research, Elsevier, vol. 314(2), pages 409-432.
    7. Cao, Qidong & Patterson, J. Wayne & Bai, Xue, 2005. "Reexamination of processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 164(1), pages 185-194, July.
    8. Holthaus, Oliver & Rajendran, Chandrasekharan, 1997. "Efficient dispatching rules for scheduling in a job shop," International Journal of Production Economics, Elsevier, vol. 48(1), pages 87-105, January.
    9. Winker, Peter & Gilli, Manfred, 2004. "Applications of optimization heuristics to estimation and modelling problems," Computational Statistics & Data Analysis, Elsevier, vol. 47(2), pages 211-223, September.
    10. Portmann, M. -C. & Vignier, A. & Dardilhac, D. & Dezalay, D., 1998. "Branch and bound crossed with GA to solve hybrid flowshops," European Journal of Operational Research, Elsevier, vol. 107(2), pages 389-400, June.
    11. Tugba Saraç & Feristah Ozcelik & Mehmet Ertem, 2023. "Unrelated parallel machine scheduling problem with stochastic sequence dependent setup times," Operational Research, Springer, vol. 23(3), pages 1-19, September.
    12. Ho, Nhu Binh & Tay, Joc Cing & Lai, Edmund M.-K., 2007. "An effective architecture for learning and evolving flexible job-shop schedules," European Journal of Operational Research, Elsevier, vol. 179(2), pages 316-333, June.
    13. Alan S. Manne, 1961. "Input-Output and Activity Analysis in Industrial Concerns," Cowles Foundation Discussion Papers 118, Cowles Foundation for Research in Economics, Yale University.
    14. Allahverdi, Ali & Soroush, H.M., 2008. "The significance of reducing setup times/setup costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 978-984, June.
    15. Didden, Jeroen B.H.C. & Dang, Quang-Vinh & Adan, Ivo J.B.F., 2024. "Enhancing stability and robustness in online machine shop scheduling: A multi-agent system and negotiation-based approach for handling machine downtime in industry 4.0," European Journal of Operational Research, Elsevier, vol. 316(2), pages 569-583.
    16. He, Xuan & Pan, Quan-Ke & Gao, Liang & Neufeld, Janis S. & Gupta, Jatinder N.D., 2024. "Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times," Omega, Elsevier, vol. 123(C).
    17. Nait Tahar, Djamel & Yalaoui, Farouk & Chu, Chengbin & Amodeo, Lionel, 2006. "A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 63-73, February.
    18. Chen, Wenchong & Gong, Xuejian & Rahman, Humyun Fuad & Liu, Hongwei & Qi, Ershi, 2021. "Real-time order acceptance and scheduling for data-enabled permutation flow shops: Bilevel interactive optimization with nonlinear integer programming," Omega, Elsevier, vol. 105(C).
    19. Amirhosein Gholami & Nasim Nezamoddini & Mohammad T. Khasawneh, 2023. "Customized orders management in connected make-to-order supply chains," Operations Management Research, Springer, vol. 16(3), pages 1428-1443, September.
    20. Klein, Robert & Koch, Sebastian & Steinhardt, Claudius & Strauss, Arne K., 2020. "A review of revenue management: Recent generalizations and advances in industry applications," European Journal of Operational Research, Elsevier, vol. 284(2), pages 397-412.

    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:ijsaem:v:16:y:2025:i:3:d:10.1007_s13198-025-02714-7. 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.