𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sensitivity analysis for some scheduling problems

✍ Scribed by Zhen-duo Jiang; Shi-jie Sun; Zhi-gang Wu

Book ID
107482562
Publisher
Chinese Electronic Periodical Services
Year
2008
Tongue
English
Weight
192 KB
Volume
12
Category
Article
ISSN
1007-6417

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Comparability graph augmentation for som
Comparability graph augmentation for some multiprocessor scheduling problems
✍ P. Dell'Olmo; M.Grazia Speranza; Zs. Tuza πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 944 KB

A comparability graph is a graph which admits a transitive orientation. In this paper we consider the problem of augmenting a graph to a comparability graph in such a way that the maximum weight of its cliques is minimum. The problem is equivalent to a multiprocessor scheduling problem and to the i