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”

Constraint Programming and constructive heuristics for parallel machine scheduling with sequence-dependent setups and common servers

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F22%3A00361840" target="_blank" >RIV/68407700:21230/22:00361840 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21730/22:00361840

  • Result on the web

    <a href="https://doi.org/10.1016/j.cie.2022.108586" target="_blank" >https://doi.org/10.1016/j.cie.2022.108586</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.cie.2022.108586" target="_blank" >10.1016/j.cie.2022.108586</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Constraint Programming and constructive heuristics for parallel machine scheduling with sequence-dependent setups and common servers

  • Original language description

    This paper examines scheduling problem denoted as ???? |????????????, ????????????|???????????????? in Graham’s notation; in other words, scheduling of tasks on parallel identical machines (???? ) with sequence-dependent setups (????????????) each performed by one of the available servers (????????????). The goal is to minimize the makespan (????????????????). We propose a Constraint Programming (CP) model for finding the optimal solution and constructive heuristics suitable for large problem instances. These heuristics are also used to provide a feasible starting solution to the proposed CP model, significantly improving its efficiency. This combined approach constructs solutions for benchmark instances of up to 20 machines and 500 tasks in 10 s, with makespans 3 % to 11.5 % greater than the calculated lower bounds with a 5% average. The extensive experimental comparison also shows that our proposed approaches outperform the existing ones.

  • 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

    <a href="/en/project/EF16_026%2F0008432" target="_blank" >EF16_026/0008432: Cluster 4.0 - Methodology of System Integration</a><br>

  • Continuities

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

Others

  • Publication year

    2022

  • 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

    172

  • Issue of the periodical within the volume

    October

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    16

  • Pages from-to

  • UT code for WoS article

    000864653000014

  • EID of the result in the Scopus database

    2-s2.0-85137028802