𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of two circle connecting problems

✍ Scribed by Nen-Fu Huang

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
910 KB
Volume
47
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ 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

Complexity of two dual criteria scheduli
Complexity of two dual criteria scheduling problems
✍ Yumei Huo; J.Y.-T. Leung; Hairong Zhao πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 185 KB

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.