All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • 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

    <a href="/en/project/GA22-31670S" target="_blank" >GA22-31670S: Scheduling Tests in Medical Laboratories: Reduction of Turn-Around Time</a><br>

  • Continuities

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

Others

  • Publication year

    2023

  • 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

  • Article name in the collection

    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

  • Number of pages

    14

  • Pages from-to

    477-490

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Tronheim

  • Event date

    Sep 17, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article