About: Lot Streaming in Job Shop Scheduling

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

About: Lot Streaming in Job Shop Scheduling 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	Lot streaming is a process of splitting production lots (batches) into smaller transfer lots (sublots, transfer batches) and moving these sublots to the next processing stage so that operations at successive stages can be overlapped. In this paper the following assumptions are considered: Each job (production lot) is divided into equal-sized transfer lots a number of which is the same for all operations. Once a machine is set-up for a job, it cannot be used to process any other job until the processing of all transfer lots is finished. Under these assumptions it is not necessary to model the movement of individual transfer lots. Their start times are derivable from start and completion times of job operation, which can be obtained by means of approach, based on a disjunctive graph model and a modification of the Critical Path Method. It is possible to integrate this approach into any heuristic method for job shop scheduling which uses the disjunctive graph-based representation and the makespan object Lot streaming is a process of splitting production lots (batches) into smaller transfer lots (sublots, transfer batches) and moving these sublots to the next processing stage so that operations at successive stages can be overlapped. In this paper the following assumptions are considered: Each job (production lot) is divided into equal-sized transfer lots a number of which is the same for all operations. Once a machine is set-up for a job, it cannot be used to process any other job until the processing of all transfer lots is finished. Under these assumptions it is not necessary to model the movement of individual transfer lots. Their start times are derivable from start and completion times of job operation, which can be obtained by means of approach, based on a disjunctive graph model and a modification of the Critical Path Method. It is possible to integrate this approach into any heuristic method for job shop scheduling which uses the disjunctive graph-based representation and the makespan object (en)
Title	Lot Streaming in Job Shop Scheduling Lot Streaming in Job Shop Scheduling (en)
skos:prefLabel	Lot Streaming in Job Shop Scheduling Lot Streaming in Job Shop Scheduling (en)
skos:notation	RIV/00216305:26210/01:PU20835!RIV/2002/MSM/262102/N
http://linked.open.../vavai/riv/strany	13/1
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM 261100009)
http://linked.open...vai/riv/dodaniDat	2002
http://linked.open...aciTvurceVysledku	Dvořák, Jiří
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é učení technické v Brně / Fakulta strojního inženýrství
http://linked.open...dnocenehoVysledku	685557
http://linked.open...ai/riv/idVysledku	RIV/00216305:26210/01:PU20835
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	job shop scheduling, lot streaming, disjunctive graph (en)
http://linked.open.../riv/klicoveSlovo	lot streaming disjunctive graph job shop scheduling
http://linked.open...ontrolniKodProRIV	[16E35D825D51]
http://linked.open...v/mistoKonaniAkce	Ostrava
http://linked.open...i/riv/mistoVydani	Ostrava
http://linked.open...i/riv/nazevZdroje	Proceedings of the XXVI. Seminar ASR’2001 Instruments and Control. VŠB - TU Ostrava
http://linked.open...in/vavai/riv/obor	BB
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...ocetUcastnikuAkce	0 (xsd:int)
http://linked.open...nichUcastnikuAkce	0 (xsd:int)
http://linked.open...UplatneniVysledku	2001
http://linked.open...iv/tvurceVysledku	Dvořák, Jiří
http://linked.open...vavai/riv/typAkce	CST - Celostátní
http://linked.open.../riv/zahajeniAkce	2001-04-26 (xsd:date)
http://linked.open...n/vavai/riv/zamer	http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20261100009
number of pages	6 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Vysoká škola báňská - Technická univerzita Ostrava
https://schema.org/isbn	80-7078-890-9
http://localhost/t...ganizacniJednotka	26210

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, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software