𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A scheduling problem in a semi-open job shop—the case of a cordset manufacturing company

✍ Scribed by A.S. Alfa; K.L. Dolhun; C.-L. Li

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
606 KB
Volume
20
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

✦ Synopsis

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 this problem. Heuristic algorithms are presented for solving this problem.

📜 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