JOB SHOP SCHEDULING PROBLEM WITH MULTI-SHIFT WORK SYSTEM

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

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

JOB SHOP SCHEDULING PROBLEM WITH MULTI-SHIFT WORK SYSTEM

Original language description

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.

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

2009

Confidentiality

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

Name of the periodical

ACC Journal

ISSN

1803-9782

e-ISSN

—

Volume of the periodical

XV

Issue of the periodical within the volume

Number 1

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

8

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—