𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mathematical aspects of the 3 × n job-shop sequencing problem

✍ Scribed by Wlodzimierz Szwarc

Publisher
John Wiley and Sons
Year
1974
Tongue
English
Weight
299 KB
Volume
21
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A special case of the 3 × n flow shop pr
A special case of the 3 × n flow shop problem
✍ Fennell Burns; John Rooker 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

## Abstract Johnson [2] in 1954 solved the two machine flow shop problem by giving an argument for a sufficient condition of optimality and by stating an efficient algorithm which produces a solution via satisfaction of the sufficient condition. Moreover, Johnson solved two special cases of the cor

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