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”

Discrete Self-Organising Migrating Algorithm for Flow Shop Scheduling with No Wait Makespan

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86088777" target="_blank" >RIV/61989100:27240/13:86088777 - isvavai.cz</a>

  • Alternative codes found

    RIV/70883521:28120/13:43868641 RIV/70883521:28140/13:43868641

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Discrete Self-Organising Migrating Algorithm for Flow Shop Scheduling with No Wait Makespan

  • Original language description

    This paper introduces a novel Discrete Self-Organising Migrating Algorithm for the task of flow-shop scheduling with no-wait makespan. The new algorithm is tested with the small and medium Taillard benchmark problems and the obtained results are competitive with the best performing heuristics in the literature.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2013

  • 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

    Mathematical and Computer Modelling

  • ISSN

    0895-7177

  • e-ISSN

  • Volume of the periodical

    57

  • Issue of the periodical within the volume

    1-2

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    11

  • Pages from-to

    100-110

  • UT code for WoS article

  • EID of the result in the Scopus database