✦ LIBER ✦

Two-machine flow shop no-wait scheduling with a nonavailability interval

✍ Scribed by Mikhail A. Kubzin; Vitaly A. Strusevich

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 154 KB
Volume: 51
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.10118

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial-time approximation schemes fo

Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints

✍ M.A. Kubzin; V.A. Strusevich; J. Breit; G. Schmidt 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

Scheduling and lot streaming in two-mach

Scheduling and lot streaming in two-machine open shops with no-wait in process

✍ Nicholas G. Hall; Gilbert Laporte; Esaignani Selvarajah; Chelliah Sriskandarajah 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

A heuristic for the two-machine no-wait

A heuristic for the two-machine no-wait openshop scheduling problem

✍ Jeffrey B. Sidney; Chelliah Sriskandarajah 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 2 views

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

An FPTAS for scheduling a two-machine fl

An FPTAS for scheduling a two-machine flowshop with one unavailability interval

✍ C.T. Ng; Mikhail Y. Kovalyov 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

## Abstract We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. Th