๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Complexity of the scheduling languageRSV

โœ Scribed by Pok-Son Kim; Arne Kutzner; Taehoon Park

Book ID
105626060
Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
777 KB
Volume
20
Category
Article
ISSN
1598-5865

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