Job Shop Scheduling with Transfer Batches

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F00%3A00000097" target="_blank" >RIV/00216305:26210/00:00000097 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Job Shop Scheduling with Transfer Batches

Popis výsledku v původním jazyce

This paper presents a job shop scheduling problem where each job (production batch) can be split into multiple equal-sized transfer batches, which can be moved to the next operation immediately after their completion on the current operation. The start times of transfer batches need not be consider as decision variables and their values can be derived from start and completion times of operations on production batches. The presented approach uses a disjunctive graph model, whose size and structure is the same as in the case of the classical job shop problem, and modified Critical Path Method for computations in this graph. This approach can be integrated into any heuristic method for job shop scheduling which uses the disjunctive graph-based representation and the makespan objective.

Název v anglickém jazyce

Job Shop Scheduling with Transfer Batches

Popis výsledku anglicky

This paper presents a job shop scheduling problem where each job (production batch) can be split into multiple equal-sized transfer batches, which can be moved to the next operation immediately after their completion on the current operation. The start times of transfer batches need not be consider as decision variables and their values can be derived from start and completion times of operations on production batches. The presented approach uses a disjunctive graph model, whose size and structure is the same as in the case of the classical job shop problem, and modified Critical Path Method for computations in this graph. This approach can be integrated into any heuristic method for job shop scheduling which uses the disjunctive graph-based representation and the makespan objective.

Druh

C - Kapitola v odborné knize

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2000

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název knihy nebo sborníku

Soft Computing Techniques and Applications

ISBN

3-7908-1257-9

Počet stran výsledku

6

Strana od-do

—

Počet stran knihy

—

Název nakladatele

Physica-Verlag

Místo vydání

Heidelberg

Kód UT WoS kapitoly

—