𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of preemptive open-shop scheduling problems

✍ Scribed by C.Y Liu; R.L Bulfin

Book ID
107918085
Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
282 KB
Volume
4
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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