Scheduling Job Shops Using Genetic Algorithms and Local Search Framework

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F99%3A00000061" target="_blank" >RIV/00216305:26210/99:00000061 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Scheduling Job Shops Using Genetic Algorithms and Local Search Framework

Original language description

This paper provides a comparison of the application of stochastic heuristic techniques (genetic algorithms, simulated annealing and tabu search) to job shop scheduling. It presents computational results achieved for three typical representation schemes using standard benchmark problems.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

1999

Confidentiality

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

Article name in the collection

Mendel '99. 5th International Conference on Soft Computing

ISBN

80-214-1131-7

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

—

Publisher name

VUT FSI ÚAI

Place of publication

Brno, ČR

Event location

—

Event date

—

Type of event by nationality

—

UT code for WoS article

—