Detail publikace

Job Shop Scheduling with Transfer Batches

DVOŘÁK, J., ŠEDA, M., VLÁČIL, T.

Originální název

Job Shop Scheduling with Transfer Batches

Typ

kapitola v knize

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova v angličtině

job shop scheduling, disjunctive graph, transfer batch, heuristic methods

Autoři

DVOŘÁK, J., ŠEDA, M., VLÁČIL, T.

Rok RIV

2000

Vydáno

1. 1. 2000

Nakladatel

Physica-Verlag

Místo

Heidelberg

ISBN

3-7908-1257-9

Kniha

Robert John, Ralph Birkenhead (eds.) Soft Computing Techniques and Applications

Edice

Advances in Soft Computing

Strany od

105

Strany do

110

Strany počet

6

BibTex

@inbook{BUT54982,
  author="Jiří {Dvořák} and Miloš {Šeda} and Tomáš {Vláčil}",
  title="Job Shop Scheduling with Transfer Batches",
  booktitle="Robert John, Ralph Birkenhead (eds.) Soft Computing Techniques and Applications",
  year="2000",
  publisher="Physica-Verlag",
  address="Heidelberg",
  series="Advances in Soft Computing",
  pages="6",
  isbn="3-7908-1257-9"
}