𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The one-machine sequencing problem with dependent jobs

✍ Scribed by Stephane Dauzere-Peres

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
256 KB
Volume
25
Category
Article
ISSN
0360-8352

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