About: Finding Non-permutation Schedules for Flowshops Using Tabu Search Algorithm

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

About: Finding Non-permutation Schedules for Flowshops Using Tabu Search Algorithm 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	General opinion is that near-optimal solutions of the chemical flowshop sequencing problem can be arrived at under assumption of permutation schedule. The permutation schedule limits the search space, assuming that the sequence of products is identical on all processing units, and therefore the optimization is less difficult. In this paper, results of application of a tabu search algorithm to the sequencing problem where non-permutation schedules are used are presented. The problem is formulated as a minimization of makespan with unlimited intermediate storage interstage policy, with time-requirements model of operations. A comparison is made between permutation schedule and non-permutation schedule solutions. The results of tests of different variantsof tabu search algorithm are discussed, and comparison is made between tabu search and other optimization techniques. General opinion is that near-optimal solutions of the chemical flowshop sequencing problem can be arrived at under assumption of permutation schedule. The permutation schedule limits the search space, assuming that the sequence of products is identical on all processing units, and therefore the optimization is less difficult. In this paper, results of application of a tabu search algorithm to the sequencing problem where non-permutation schedules are used are presented. The problem is formulated as a minimization of makespan with unlimited intermediate storage interstage policy, with time-requirements model of operations. A comparison is made between permutation schedule and non-permutation schedule solutions. The results of tests of different variantsof tabu search algorithm are discussed, and comparison is made between tabu search and other optimization techniques. (en)
Title	Finding Non-permutation Schedules for Flowshops Using Tabu Search Algorithm Finding Non-permutation Schedules for Flowshops Using Tabu Search Algorithm (en)
skos:prefLabel	Finding Non-permutation Schedules for Flowshops Using Tabu Search Algorithm Finding Non-permutation Schedules for Flowshops Using Tabu Search Algorithm (en)
skos:notation	RIV/60461373:22340/02:00007163!RIV/2004/MSM/223404/N
http://linked.open.../vavai/riv/strany	103;109
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
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	646212
http://linked.open...ai/riv/idVysledku	RIV/60461373:22340/02:00007163
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	[B9D3AF4EFC8E]
http://linked.open...v/mistoKonaniAkce	Rožnov pod Radhoštěm
http://linked.open...i/riv/mistoVydani	Brno
http://linked.open...i/riv/nazevZdroje	Proc. of 36th International Conference MOSIS '02
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	1 (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-04-22 (xsd:date)
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20223400007
number of pages	7 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Vysoké učení technické v Brně. Fakulta informačních technologií
https://schema.org/isbn	80-85988-71-2
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