An efficient approach for solving a job shop scheduling problem with resources constraints: a case study iCIM 3000

Abdelkader Hadri, Aimade Eddine Bougloula, Fayçal Belkaid and Hacene Smadi

International Journal of Operational Research, 2023, vol. 46, issue 1, 73-92

Abstract: In this work, we are interested in a job shop scheduling problem (JSSP) with resources availability constraints. The aim consists in scheduling a set of N jobs on M machines. To be processed in the system, each job needs an number of consumable resources that are available in a limited quantity. Solving such a problem means finding better jobs sequencing in order to minimise the maximum execution time. We suggest two different methods to solve the above-mentioned problem. We firstly propose a set of four heuristics based on priority rules. Then, we make call to genetic algorithm. Using a real job shop manufacturing system data, a large-scale experiment was performed in order to analyse the performance of the proposed methods. The studied system is called iCIM 3000. The simulation results reveal that the new proposed heuristics are better than genetic algorithms and achieve to good solutions in shorter time.

Keywords: job shop; non-renewable resources; heuristics; genetic algorithms; iCIM 3000. (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=128581 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:46:y:2023:i:1:p:73-92

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().