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”

Total Setup Time Minimisation in Production Scheduling with Alternatives

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00317229" target="_blank" >RIV/68407700:21230/17:00317229 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21730/17:00317229

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007/978-3-319-64635-0_2" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-319-64635-0_2</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-64635-0_2" target="_blank" >10.1007/978-3-319-64635-0_2</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Total Setup Time Minimisation in Production Scheduling with Alternatives

  • Original language description

    The research presented in this paper is focused on the scheduling problem with alternative process plans where the goal is to minimise the sum of all the performed setup times in the schedule. The setup times play an important role in scheduling problems, yet they are, in most cases, considered only as an additional constraint, not as a part of the objective function. We propose a model, based on the resource constrained project scheduling problem with alternative process plans, release times and deadlines, that includes the setup times in the scheduling criterion. Both the exact mathematical model and the new heuristic algorithm are proposed to solve the problem. The effectiveness of the proposed two-phase heuristic algorithm, designed with the intention to solve the large instances of the problem, is evaluated on a wide set of 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/GA16-23509S" target="_blank" >GA16-23509S: Flexible Scheduling and Optimization Algorithms for Distributed Real-time Embedded Systems</a><br>

  • Continuities

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

Others

  • Publication year

    2017

  • 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

    Industrial Applications of Holonic and Multi-Agent Systems

  • ISBN

    978-3-319-64634-3

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    13

  • Pages from-to

    11-23

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Lyon

  • Event date

    Sep 28, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article