An open-source framework for solving shop scheduling problems in manufacturing environments

Carlos R. H. Márquez (), Vanessa Braganholo () and Celso C. Ribeiro ()
Additional contact information
Carlos R. H. Márquez: Universidade Federal Fluminense
Vanessa Braganholo: Universidade Federal Fluminense
Celso C. Ribeiro: Universidade Federal Fluminense

Annals of Operations Research, 2025, vol. 351, issue 1, No 40, 1155-1183

Abstract: Abstract Scheduling problems refer to the decision-making process of allocating tasks to resources, usually scarce and in high demand, to optimize different performance measures. We consider the class of shop scheduling problems arising in the context of manufacturing systems, which are often NP-hard and challenging to solve. Exact methods have limitations in finding optimal solutions in reasonable computation times, even for instances of moderate size. Therefore, in real-life production environments, finding high-quality solutions is often satisfactory, even if they are not optimal. We contribute to the solution of shop scheduling problems with the design and implementation of the SSP-3M framework, oriented by three main guidelines: versatility, extensibility, and independence of the optimization method. These characteristics reduce the gap between scheduling theory and practice in real-life environments and improve the integration of the scheduling framework with other process planning or functions such as Computer-aided Process Planning, Advanced Planning and Scheduling, Integrated Process Planning and Scheduling, and Computer Integrated Manufacturing. The problem and solution representations adopted in our framework design make it possible to handle six shop scheduling problem variants, illustrating its versatility: job shop, flow shop, permutation flow shop, generalized flow shop, flexible flow shop, and flexible job shop. SSP-3M is open-source and can be used by any interested party. Our experimental evaluation shows that it can successfully be integrated with external optimization methods. We claim that SSP-3M is a good choice for companies that need free and quick-to-develop solutions to shop scheduling problems.

Keywords: Scheduling framework; Shop scheduling; Manufacturing systems; Job shop problem; Flow shop problem; Scheduling algorithms; Combinatorial optimization; Open-source; Manufacturing environment (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-024-05995-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:annopr:v:351:y:2025:i:1:d:10.1007_s10479-024-05995-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-024-05995-6

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().