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

Complexity of two dual criteria scheduling problems

โœ Scribed by Yumei Huo; J.Y.-T. Leung; Hairong Zhao

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
185 KB
Volume
35
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. We show that both problems are binary NP-hard.

๐Ÿ“œ SIMILAR VOLUMES

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

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