✦ LIBER ✦

Sequencing n jobs on two machines with setup, processing and removal times separated

✍ Scribed by Dileep R. Sule

Publisher: John Wiley and Sons
Year: 1982
Tongue: English
Weight: 121 KB
Volume: 29
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800290313

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling jobs, with exponentially dist

Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop

✍ Andrew A. Cunningham; Sujit K. Dutta 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 450 KB

Minimizing flow time on a single machine

Minimizing flow time on a single machine with job classes and setup times

✍ A. J. Mason; E. J. Anderson 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 949 KB

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