𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of preemptive openshop scheduling problems

✍ Scribed by C. Sriskandarajah; E. Wagneur

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
731 KB
Volume
77
Category
Article
ISSN
0377-2217

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

The complexity of two group scheduling p
The complexity of two group scheduling problems
✍ Jacek Blazewicz; Mikhail Y. Kovalyov πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 94 KB

The problems of scheduling groups of jobs under the group technology assumption are studied. The two remaining open questions posed in the literature a decade ago about the computational complexity of these problems (J. Oper. Res. Soc., 1992; 43:395 -406), are answered. The parallel machine problem