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”

Bottleneck Identification in Resource-Constrained Project Scheduling via Constraint Relaxation

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F25%3A00381853" target="_blank" >RIV/68407700:21730/25:00381853 - isvavai.cz</a>

  • Result on the web

    <a href="http://hdl.handle.net/10467/124624" target="_blank" >http://hdl.handle.net/10467/124624</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.5220/0013253700003893" target="_blank" >10.5220/0013253700003893</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Bottleneck Identification in Resource-Constrained Project Scheduling via Constraint Relaxation

  • Original language description

    In realistic production scenarios, Advanced Planning and Scheduling (APS) tools often require manual intervention by production planners, as the system works with incomplete information, resulting in suboptimal schedules. Often, the preferable solution is not found just because of the too-restrictive constraints specifying the optimization problem, representing bottlenecks in the schedule. To provide computer-assisted support for decision-making, we aim to automatically identify bottlenecks in the given schedule while linking them to the particular constraints to be relaxed. In this work, we address the problem of reducing the tardiness of a particular project in an obtained schedule in the resource-constrained project scheduling problem by relaxing constraints related to identified bottlenecks. We develop two methods for this purpose. The first method adapts existing approaches from the job shop literature and utilizes them for so-called untargeted relaxations. The second method ide ntifies potential improvements in relaxed versions of the problem and proposes targeted relaxations. Surprisingly, the untargeted relaxations result in improvements comparable to the targeted relaxations.

  • 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

    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

  • Article name in the collection

    Proceedings of the 14th International Conference on Operations Research and Enterprise Systems

  • ISBN

    978-989-758-732-0

  • ISSN

    2184-4372

  • e-ISSN

    2184-4372

  • Number of pages

    8

  • Pages from-to

    340-347

  • Publisher name

    SciTePress

  • Place of publication

    Setùbal

  • Event location

    Porto

  • Event date

    Feb 23, 2025

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article