𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A preemptive open shop scheduling problem with one resource

✍ Scribed by D. de Werra; J. Błażewicz; W. Kubiak

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
315 KB
Volume
10
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The open shop scheduling problem with a
The open shop scheduling problem with a given sequence of jobs on one machine
✍ Y.M. Shafransky; V.A. Strusevich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a

A scheduling problem in a semi-open job
A scheduling problem in a semi-open job shop—the case of a cordset manufacturing company
✍ A.S. Alfa; K.L. Dolhun; C.-L. Li 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 606 KB

consider the scheduling of a cordset manufacturing process through several operations. The department is a semi-open job shop. The first and last operations are defined, but the remaining operations can be sequenced in a semi-flexible manner. We present a mixed-integer programming formulation of thi