JOB SHOP SCHEDULING PROBLEM WITH MULTI-SHIFT WORK SYSTEM

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24210%2F09%3A%230001435" target="_blank" >RIV/46747885:24210/09:#0001435 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
JOB SHOP SCHEDULING PROBLEM WITH MULTI-SHIFT WORK SYSTEM
Popis výsledku v původním jazyce
Job shop scheduling problem is well known NP-hard optimization problem. There are a lot of optimization techniques to optimize theoretical problems. It is necessary to use additional constraints to optimize real world cases.This paper presents job shop scheduling in the multi-shift work system environment. There is presented modification of Giffler and Thompson (GT) Constructive Algorithm (CA) at first. Than before mentioned modification is tested on well known theoretical problem by CA, Local Search (LS) and Genetic Algorithm (GA). Article also focuses on time span of these methods.
Název v anglickém jazyce
JOB SHOP SCHEDULING PROBLEM WITH MULTI-SHIFT WORK SYSTEM
Popis výsledku anglicky
Job shop scheduling problem is well known NP-hard optimization problem. There are a lot of optimization techniques to optimize theoretical problems. It is necessary to use additional constraints to optimize real world cases.This paper presents job shop scheduling in the multi-shift work system environment. There is presented modification of Giffler and Thompson (GT) Constructive Algorithm (CA) at first. Than before mentioned modification is tested on well known theoretical problem by CA, Local Search (LS) and Genetic Algorithm (GA). Article also focuses on time span of these methods.

Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
JR - Ostatní strojírenství
OECD FORD obor
—

Rok uplatnění
2009
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ů

Podobné výsledky(10)