This HTML5 document contains 40 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n18http://purl.org/net/nknouf/ns/bibtex#
n8http://localhost/temp/predkladatel/
n13http://linked.opendata.cz/ontology/domain/vavai/
n16https://schema.org/
n14http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26210%2F00%3A00000162%21RIV%2F2001%2FMSM%2F262101%2FN/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26210%2F00%3A00000162%21RIV%2F2001%2FMSM%2F262101%2FN
rdf:type
skos:Concept n13:Vysledek
dcterms:description
In this paper we investigate a problem of integrated lot sizing and scheduling in a permutation flow shop under the assumption of constant continuous demands over an infinite planning horizon. The objective is to find a sequence of production and lot sizes that minimise the sum of average set-up costs and average inventory holding costs. We study and compare three approaches based on genetic algorithms. In this paper we investigate a problem of integrated lot sizing and scheduling in a permutation flow shop under the assumption of constant continuous demands over an infinite planning horizon. The objective is to find a sequence of production and lot sizes that minimise the sum of average set-up costs and average inventory holding costs. We study and compare three approaches based on genetic algorithms.
dcterms:title
Application of Genetic Algorithms to Scheduling and Lot Sizing in a Flow Shop Application of Genetic Algorithms to Scheduling and Lot Sizing in a Flow Shop
skos:prefLabel
Application of Genetic Algorithms to Scheduling and Lot Sizing in a Flow Shop Application of Genetic Algorithms to Scheduling and Lot Sizing in a Flow Shop
skos:notation
RIV/00216305:26210/00:00000162!RIV/2001/MSM/262101/N
n3:strany
45
n3:aktivita
n15:Z
n3:aktivity
Z(MSM 261100009)
n3:dodaniDat
n7:2001
n3:domaciTvurceVysledku
Majer, Petr Dvořák, Jiří
n3:druhVysledku
n19:D
n3:duvernostUdaju
n12:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
705000
n3:idVysledku
RIV/00216305:26210/00:00000162
n3:jazykVysledku
n4:eng
n3:klicovaSlova
flow shop; lot sizing; scheduling; genetic algorithms
n3:klicoveSlovo
n9:flow%20shop n9:scheduling n9:genetic%20algorithms n9:lot%20sizing
n3:kontrolniKodProRIV
[C9FED4F38609]
n3:mistoVydani
Brno, Czech Republic
n3:nazevZdroje
6th International Conference on Soft Computing MENDEL 2000
n3:obor
n5:BB
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n7:2000
n3:tvurceVysledku
Dvořák, Jiří Majer, Petr
n3:zamer
n14:MSM%20261100009
s:numberOfPages
7
n18:hasPublisher
PC-DIR Brno
n16:isbn
80-214-1609-2
n8:organizacniJednotka
26210