zbMATH — the first resource for mathematics

Scheduling subject to nonrenewable-resource constraints. (English) Zbl 0494.90041

90B35 Deterministic scheduling theory in operations research
68Q25 Analysis of algorithms and problem complexity
Full Text: DOI
[1] Abdel-Wahab, H.M., Scheduling with applications to register allocation and deadlock problems, ()
[2] Aho, A.V.; Hopcroft, J.E.; Ullman, J.D., The design and analysis of computer algorithms, (1974), Addison-Wesley Reading, MA · Zbl 0207.01701
[3] Carlier, J., Complexité des problèmes d’ordonnancements à contraintes de financement, (1980), Université de Paris VI, Working paper
[4] Lenstra, J.K.; Rinnooy Kan, A.H.G., Computational complexity of discrete optimization problems, Ann. discrete math., 4, 281-300, (1979) · Zbl 0411.68042
[5] R. Słowinski, “Multiobjective network scheduling with efficient use of renewable and non-renewable resources”, Technical Paper, Institute of Control Engineering, Poznán, Poland. · Zbl 0455.90049
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.