𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Total completion time minimization in two-machine job shops with unit-time operations

✍ Scribed by Wieslaw Kubiak; Vadim Timkovsky

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
802 KB
Volume
94
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A note on the two machine job shop with
A note on the two machine job shop with exponential processing times
✍ Michael Pinedo πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 215 KB

## Abstract Consider two machines, labeled 1 and 2. A set of tasks has to be processed first on machine 1 and after that on machine 2. A second set of tasks has to be processed first on machine 2 and after that on machine 1. All the processing times are exponentially distributed. We present a polic