A batch production scheduling problem in a reconfigurable hybrid manufacturing-remanufacturing system
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F25%3A00383908" target="_blank" >RIV/68407700:21730/25:00383908 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.cie.2025.111099" target="_blank" >https://doi.org/10.1016/j.cie.2025.111099</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.cie.2025.111099" target="_blank" >10.1016/j.cie.2025.111099</a>
Alternative languages
Result language
angličtina
Original language name
A batch production scheduling problem in a reconfigurable hybrid manufacturing-remanufacturing system
Original language description
In recent years, remanufacturing of End-of-Life (EOL) products has been adopted by manufacturing sectors as a competent practice to enhance their sustainability and market share. Due to the mass customization of products and high volatility of market, processing of new products and remanufacturing of EOLs in the same shared facility, namely Hybrid Manufacturing-Remanufacturing System (HMRS), is a mean to keep such production efficient. Accordingly, customized production capabilities are required to increase flexibility, which can be effectively provided under the Reconfigurable Manufacturing System (RMS) paradigm. Despite the advantages of utilizing RMS technologies in HMRSs, production management of such systems suffers excessive complexity. Hence, this study concentrates on the production scheduling of an HMRS consisting of non-identical parallel reconfigurable machines where the orders can be grouped into batches. In this regard, Mixed-Integer Linear Programming (MILP) and Constraint Programming (CP) models are devised to formulate the problem. Furthermore, a computationally efficient solution method is developed based on a Logic-based Benders Decomposition (LBBD) approach. The warm start technique is also implemented by providing a decent initial solution to the MILP model. Computational experiments attest to the LBBD method’s superiority over the MILP, CP, and warm-started MILP models by obtaining an average gap of about 2%, besides it yields actionable managerial insights for scheduling in HMRSs.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Computers & Industrial Engineering
ISSN
0360-8352
e-ISSN
1879-0550
Volume of the periodical
204
Issue of the periodical within the volume
6
Country of publishing house
GB - UNITED KINGDOM
Number of pages
17
Pages from-to
—
UT code for WoS article
001478509900001
EID of the result in the Scopus database
2-s2.0-105003099849