Solving job shop scheduling with the computer simulation

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24210%2F11%3A%230002637" target="_blank" >RIV/46747885:24210/11:#0002637 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Solving job shop scheduling with the computer simulation

Popis výsledku v původním jazyce

Computer simulation of discrete events is one of most used tools in the field of manufacturing design and logistics process design, but it is still underestimated in the field of the production scheduling. This article focuses on solving a job shop scheduling problem (JSSP) with computer simulation. There is briefly introduced possible scheduling and optimization by the genetic algorithm in the Plant simulation software. Algorithm is tested on theoretical examples of classical JSSP. Comparison is made to known problems optima. Scheduling software is also used to compare not only ability to reach result near the optimal one, but also the time span of the optimization.

Název v anglickém jazyce

Solving job shop scheduling with the computer simulation

Popis výsledku anglicky

Computer simulation of discrete events is one of most used tools in the field of manufacturing design and logistics process design, but it is still underestimated in the field of the production scheduling. This article focuses on solving a job shop scheduling problem (JSSP) with computer simulation. There is briefly introduced possible scheduling and optimization by the genetic algorithm in the Plant simulation software. Algorithm is tested on theoretical examples of classical JSSP. Comparison is made to known problems optima. Scheduling software is also used to compare not only ability to reach result near the optimal one, but also the time span of the optimization.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JR - Ostatní strojírenství

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Transport & Logistics

ISSN

1451-107X

e-ISSN

—

Svazek periodika

—

Číslo periodika v rámci svazku

9

Stát vydavatele periodika

SK - Slovenská republika

Počet stran výsledku

11

Strana od-do

775-785

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—