✦ LIBER ✦

Some no-wait shops scheduling problems: Complexity aspect

✍ Scribed by Chelliah Sriskandarajah; Pierre Ladet

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 911 KB
Volume: 24
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(86)90036-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Inapproximability results for no-wait jo

Inapproximability results for no-wait job shop scheduling

✍ Gerhard J. Woeginger 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 197 KB

A pseudo-polynomial algorithm for a two-

A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem

✍ Wieslaw Kubiak 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 273 KB

Two machine flow shop scheduling problem

Two machine flow shop scheduling problem with no wait in process: controllable machine speeds

✍ Vitaly A. Strusevich 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 723 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

The complexity of cyclic shop scheduling

The complexity of cyclic shop scheduling problems

✍ Nicholas G. Hall; Tae-Eog Lee; Marc E. Posner 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 190 KB

We consider scheduling problems for shops in which a job set is manufactured repetitively. Jobs are scheduled to minimize the cycle time of the job set, which is equivalent to maximizing the throughput rate. We characterize the complexity of the scheduling problem for several types of job shops. Pol