Minimizing mean flow-time with parallel processors and resource constraints
✍ Scribed by Błażewicz, J. ;Kubiak, W. ;Röck, H. ;Szwarcfiter, J.
- Publisher
- Springer-Verlag
- Year
- 1987
- Tongue
- English
- Weight
- 578 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We investigate a single machine scheduling problem where the resource consumed depends on the release times of jobs. The objective is to minimize the total consumption subject to a constraint on the makespan or the total completion time. Results by Li are extended to the case where the consumption
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