Flowshop optimisation in MATLAB ? simulated annealing algorithm approach

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F03%3A00007543" target="_blank" >RIV/60461373:22340/03:00007543 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Flowshop optimisation in MATLAB ? simulated annealing algorithm approach

Original language description

We have created in Matlab a simulated annealing algorithm for solving scheduling problems. We have tested the possibilities of its application for sequencing of production in chemical batch plant, specifically in the case of the flowshop topology. Finding an optimum sequence of batches is a typical NP-complete problem. While using a deterministic algorithm, computation time increases exponentially with increasing dimension of input. Heuristic algorithms can be efficiently used to solve this problem. Wehave found that Matlab realization of simulated annealing algorithm allows us to obtain optimum or good suboptimum solutions in acceptable computation times. We have proposed optimal algorithm modifications and parameter settings. Matlab source code thatimplements these algorithm run acceptable speed on PC-class computers.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

CI - Industrial chemistry and chemical engineering

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2003

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

Sborník 11. konference MATLAB 2003

ISBN

80-7080-526-9

ISSN

—

e-ISSN

—

Number of pages

10

Pages from-to

463-472

Publisher name

VŠCHT

Place of publication

Praha

Event location

Praha

Event date

Nov 25, 2003

Type of event by nationality

CST - Celostátní akce

UT code for WoS article

—