𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extreme solutions of the two machine flow-shop problem

✍ Scribed by Wlodzimierz Szwarc

Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
465 KB
Volume
28
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Special cases of the flow-shop problem
Special cases of the flow-shop problem
✍ Wlodzimierz Szwarc πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 385 KB

## Abstract The paper examines all known special cases of the __m__X__n__ flow‐shop problem. It provides solution procedures to three new special cases along with the optimality proofs. The theory of the new special cases is based on the critical path concept.

An exact algorithm for the batch sequenc
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
✍ A. Agnetis; F. Rossi; G. Gristina πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 295 KB πŸ‘ 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.

Extremal Solutions of the Two-Dimensiona
Extremal Solutions of the Two-DimensionalL-Problem of Moments, II
✍ Mihai Putinar πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 403 KB

The extremal solutions of the truncated L-problem of moments in two real variables, with support included in a given compact set, are described as characteristic functions of semi-algebraic sets given by a single polynomial inequality. An exponential kernel, arising as the determinantal function of

Time complexity and linear-time approxim
Time complexity and linear-time approximation of the ancient two-machine flow shop
✍ GΓΌnter Rote; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 1998 πŸ› Springer US 🌐 English βš– 87 KB πŸ‘ 3 views

We consider the scheduling problems F2 "" C and F2"no-wait"C , i.e. makespan minimization in a two-machine flow shop, with and without no wait in process. For both problems solution algorithms based on sorting with O(n log n) running time are known, where n denotes the number of jobs. [1,2]. We pro