Job Shop Scheduling with Transfer Batches

Result code in 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>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Job Shop Scheduling with Transfer Batches

Original language description

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.

Czech name

—

Czech description

—

Type

C - Chapter in a specialist book

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2000

Confidentiality

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

Book/collection name

Soft Computing Techniques and Applications

ISBN

3-7908-1257-9

Number of pages of the result

6

Pages from-to

—

Number of pages of the book

—

Publisher name

Physica-Verlag

Place of publication

Heidelberg

UT code for WoS chapter

—