✦ LIBER ✦

A two-machine flow shop scheduling problem with controllable job processing times

✍ Scribed by Eugeniusz Nowicki; Stanisław Zdrzałka

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 639 KB
Volume: 34
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(88)90355-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for the m-mac

An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Two-machine flow shop scheduling problem

Two-machine flow shop scheduling problems with no-wait jobs

✍ J.-L. Bouquard; J.-C. Billaut; M.A. Kubzin; V.A. Strusevich 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 192 KB

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

Scheduling batches with simultaneous job

Scheduling batches with simultaneous job processing for two-machine shop problems

✍ C. N. Potts; V. A. Strusevich; T. Tautenhahn 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 210 KB 👁 2 views

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

Flow-shop batch scheduling with identica

Flow-shop batch scheduling with identical processing-time jobs

✍ Gur Mosheiov; Daniel Oron; Yaacov Ritov 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB