Planning and Scheduling of Batch Processes I

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

Result language
angličtina
Original language name
Planning and Scheduling of Batch Processes I
Original language description
Multiproduct batch plants optimization is a typical NP-complete problem, and computation time increases exponentially as the dimension of problem increases. For this reason, tabu search algorithm is used for solving this problem. Considering that this algorithm is a heuristic one, optimal algorithm structure and parameter values for solving such problems have to be determined experimentally. This required solving many test problems and statistical analysis of obtained results. Use of tabu search algorithm for scheduling of multiproduct plant proved successful. Best results can be expected for these modifications of tabu search algorithm: defining neighborhood as the set of all schedules which can be obtained by exchanging positions of two products in sequence, using steepest descent technique and using short-term memory represented by the FIFO-managed tabu-list. Using other structures of tabu search algorithm showed no or little improvements.
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ů

Similar results(10)