The exact LPT-bound for maximizing the minimum completion time
✍ Scribed by János Csirik; Hans Kellerer; Gerhard Woeginger
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 334 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The first major study of p-groups of maximal class was made by Blackburn in 1958. He showed that an important invariant of these groups is the 'degree of commutativity.' Recently (1995) Fernández-Alcober proved a best possible inequality for the degree of commutativity in terms of the order of the g
The authors consider the problem of minimizing the duration of a project under fixed resource constraints. For the case that there are only minimal time lags between the start of successive activities and that therefore the project can be described by an acyclic network, a large number of exact and