✦ LIBER ✦

The cyclic compact open-shop scheduling problem

✍ Scribed by N.V.R. Mahadev; Ph. Solot; D. de Werra

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 354 KB
Volume: 111
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90171-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the open shop scheduling problem

✍ Ulrich Dorndorf; Erwin Pesch; Toàn Phan-Huy 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 128 KB

Only few exact solution methods are available for the open shop scheduling problem. We describe a branch-and-bound algorithm for solving this problem which performs better than other existing algorithms. The key to the e ciency of our algorithm lies in the following approach: instead of analysing an

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

Open-shop scheduling problems with domin

Open-shop scheduling problems with dominated machines

✍ I. Adiri; N. Aizikowitz (Hefetz) 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB

A preemptive open shop scheduling proble

A preemptive open shop scheduling problem with one resource

✍ D. de Werra; J. Błażewicz; W. Kubiak 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Two machine open shop scheduling problem

Two machine open shop scheduling problem with bi-criteria

✍ Teruo Masuda; Hiroaki Ishii 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 363 KB

The mixed shop scheduling problem

✍ Teruo Masuda; Hiroaki Ishii; Toshio Nishida 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 540 KB