𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops

✍ Scribed by J.Z. Du; J.Y.T. Leung

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
770 KB
Volume
14
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Minimizing total weighted completion tim
Minimizing total weighted completion time in a proportionate flow shop
✍ Natalia Shakhlevich; Han Hoogeveen; Michael Pinedo πŸ“‚ Article πŸ“… 1998 πŸ› Springer US 🌐 English βš– 127 KB πŸ‘ 1 views

We study the special case of the m machine flow shop problem in which the processing time of each operation of job j is equal to p H ; this variant of the flow shop problem is known as the proportionate flow shop problem. We show that for any number of machines and for any regular performance criter