𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel complete anytime procedure for project scheduling under multiple resource constraints

✍ Scribed by Reza Zamani

Publisher
Springer
Year
2010
Tongue
English
Weight
206 KB
Volume
50
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Scheduling problems for parallel dedicat
Scheduling problems for parallel dedicated machines under multiple resource constraints
✍ H. Kellerer; V.A. Strusevich πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 249 KB

The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classiΓΏcation is obtained, a number of polynomial-time algorithms are designed. For the problem with a ΓΏxed number of machines in which a job uses at mo