๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Transporting jobs through a two-machine open shop

โœ Scribed by Irina N. Lushchakova; Alan J. Soper; Vitaly A. Strusevich

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
224 KB
Volume
56
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The open shop scheduling problem with a
The open shop scheduling problem with a given sequence of jobs on one machine
โœ Y.M. Shafransky; V.A. Strusevich ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 186 KB ๐Ÿ‘ 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a

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