A Constraint Programming Model for a Reconfigurable Job Shop Scheduling Problem with Machine Availability

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F23%3A00370586" target="_blank" >RIV/68407700:21730/23:00370586 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-031-43670-3_33" target="_blank" >https://doi.org/10.1007/978-3-031-43670-3_33</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-031-43670-3_33" target="_blank" >10.1007/978-3-031-43670-3_33</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A Constraint Programming Model for a Reconfigurable Job Shop Scheduling Problem with Machine Availability

Popis výsledku v původním jazyce

A reconfigurable manufacturing system (RMS) is one of the attractive production paradigms that has emerged to face the challenges in the market. Moreover, in a real production system, machines may be out of reach because of various reasons, such as inspection, periodic maintenance, and sudden breakdown. Implementing a proper schedule in this environment can have a significant impact on the growth and success of manufacturing companies. In this regard, this paper deals with scheduling in a reconfigurable job shop environment consisting of flexible maintenance operations. To this aim, a mixed-integer linear programming (MILP) model is presented to minimize the makespan. Regarding the high complexity of the problem and the industrial need of having good solutions in a short time, a constraint programming (CP) model is developed as well. Then, a computational experiment and sensitivity analysis are conducted. The presented models are assessed by solving a series of test problems. It is concluded that the proposed CP model significantly outperforms the MILP model for large-sized instances.

Název v anglickém jazyce

A Constraint Programming Model for a Reconfigurable Job Shop Scheduling Problem with Machine Availability

Popis výsledku anglicky

A reconfigurable manufacturing system (RMS) is one of the attractive production paradigms that has emerged to face the challenges in the market. Moreover, in a real production system, machines may be out of reach because of various reasons, such as inspection, periodic maintenance, and sudden breakdown. Implementing a proper schedule in this environment can have a significant impact on the growth and success of manufacturing companies. In this regard, this paper deals with scheduling in a reconfigurable job shop environment consisting of flexible maintenance operations. To this aim, a mixed-integer linear programming (MILP) model is presented to minimize the makespan. Regarding the high complexity of the problem and the industrial need of having good solutions in a short time, a constraint programming (CP) model is developed as well. Then, a computational experiment and sensitivity analysis are conducted. The presented models are assessed by solving a series of test problems. It is concluded that the proposed CP model significantly outperforms the MILP model for large-sized instances.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA22-31670S" target="_blank" >GA22-31670S: Rozvrhování prováděných testů ve zdravotnických laboratořích: zkrácení doby dodání výsledku</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2023

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Advances in Production Management Systems. Production Management Systems for Responsible Manufacturing, Service, and Logistics Futures

ISBN

978-3-031-43672-7

ISSN

1868-4238

e-ISSN

1868-422X

Počet stran výsledku

14

Strana od-do

477-490

Název nakladatele

Springer

Místo vydání

Cham

Místo konání akce

Tronheim

Datum konání akce

17. 9. 2023

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—