Skip to main content

1994 | OriginalPaper | Buchkapitel

Flow Shop

verfasst von : V. S. Tanaev, Y. N. Sotskov, V. A. Strusevich

Erschienen in: Scheduling Theory. Multi-Stage Systems

Verlag: Springer Netherlands

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

The jobs of a set N = 1, 2,…, n are processed in a system consisting of M sequential machines. A job i ∈ N is available at time d i ≥ 0. The routes (machine processing orders) are identical for all jobs of set N and are determined by the sequence of machines 1, 2,…, M. The processing times t iL ≥ 0 of each job i ∈ N on each machine L, 1 ∈ L ∈ M, are given. Simultaneous processing of any job on several machines is not allowed. Moreover, each machine processes no more than one job at a time. Such a processing system is called a flow shop.

Metadaten
Titel
Flow Shop
verfasst von
V. S. Tanaev
Y. N. Sotskov
V. A. Strusevich
Copyright-Jahr
1994
Verlag
Springer Netherlands
DOI
https://doi.org/10.1007/978-94-011-1192-8_2