𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two-machine shop scheduling with zero and unit processing times

✍ Scribed by Irene N Lushchakova; Svetlana A Kravchenko

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
206 KB
Volume
107
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Two machine openshop scheduling with mac
Two machine openshop scheduling with machine-dependent processing times
✍ Asoo J. Vakharia; BΓΌlent Γ‡atay πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 408 KB

In a recent paper, Dror (1992) presented several results for openshop scheduling with machine dependent processing times. In this note, we present clarifications regarding the algorithm developed by him for minimizing the sum of job completion times (or average flow time) in a 2 machine openshop and

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