About: Tabu Search Algorithm for Batch Plant Scheduling

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Tabu Search Algorithm for Batch Plant Scheduling - MATLAB Implementation Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. 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. (en)
Title	Tabu Search Algorithm for Batch Plant Scheduling - MATLAB Implementation Tabu Search Algorithm for Batch Plant Scheduling - MATLAB Implementation (en)
skos:prefLabel	Tabu Search Algorithm for Batch Plant Scheduling - MATLAB Implementation Tabu Search Algorithm for Batch Plant Scheduling - MATLAB Implementation (en)
skos:notation	RIV/60461373:22340/02:00007167!RIV/2004/MSM/223404/N
http://linked.open.../vavai/riv/strany	655;662
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM 223400007)
http://linked.open...vai/riv/dodaniDat	2004
http://linked.open...aciTvurceVysledku	Poživil, Jaroslav Žďánský, Martin
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola chemicko-technologická v Praze / Fakulta chemicko-inženýrská
http://linked.open...dnocenehoVysledku	666335
http://linked.open...ai/riv/idVysledku	RIV/60461373:22340/02:00007167
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	tabu search; batch plant; sequencing; scheduling; flowshop (en)
http://linked.open.../riv/klicoveSlovo	scheduling sequencing tabu search flowshop batch plant
http://linked.open...ontrolniKodProRIV	[9C091F687C30]
http://linked.open...v/mistoKonaniAkce	Praha
http://linked.open...i/riv/mistoVydani	Praha
http://linked.open...i/riv/nazevZdroje	Sborník příspěvků 10. Ročníku konference MATLAB 2002
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...ocetUcastnikuAkce	0 (xsd:int)
http://linked.open...nichUcastnikuAkce	0 (xsd:int)
http://linked.open...UplatneniVysledku	2002
http://linked.open...iv/tvurceVysledku	Poživil, Jaroslav Žďánský, Martin
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2002-11-07 (xsd:date)
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20223400007
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Humusoft
https://schema.org/isbn	80-7080-500-5
http://localhost/t...ganizacniJednotka	22340

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software