Optimizing Non-Permutation Schedules of Batch Flowshops

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F01%3A00003888" target="_blank" >RIV/60461373:22340/01:00003888 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Optimizing Non-Permutation Schedules of Batch Flowshops
Original language description
The problem of optimization of batch process production plan is most often solved for flowshop topology, i.e. for simple series of apparatuses. This paper deals with the possibilities of application of tabu search heuristics to an expanded variant of such a topology, specifically to flowshops with added limited number of doubled apparatuses; we optimize both production plan and plant topology. The problem is formulated as a minimization of makespan on flowshop with parallel units that operates under unlimited intermediate storage interstage policy or no intermediate storage policy. We describe an adaptation of tabu search algorithm to solving PPS problems with flowshops with extra processing units, and evaluate it using program containing this algorithm.
Czech name
—
Czech description
—

Publication year
2001
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
Proc. of the 13th Int. Conf. on Process Control PC '01
ISBN
80-227-1542-5
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
"P058-1"-"P058-5"
Publisher name
Slovak University of Technology
Place of publication
Bratislava
Event location
Štrbské Pleso, High Tatras, Slovakia
Event date
Jun 11, 2001
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)