Solving job shop scheduling with the computer simulation

Result code in 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>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Solving job shop scheduling with the computer simulation

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JR - Other machinery industry

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2011

Confidentiality

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

Name of the periodical

Transport & Logistics

ISSN

1451-107X

e-ISSN

—

Volume of the periodical

—

Issue of the periodical within the volume

9

Country of publishing house

SK - SLOVAKIA

Number of pages

11

Pages from-to

775-785

UT code for WoS article

—

EID of the result in the Scopus database

—