论文信息 - Scheduling subject to nonrenewable-resource constraints

Scheduling subject to nonrenewable-resource constraints

Polynomially bounded solution methods are presented to solve a class of precedence constrained scheduling problems in which each job requires a certain amount of nonrenewable resource that is being consumed during its execution.

Alexander H. G. Rinnooy Kan | J. Carlier | A. Kan | J. Carlier

[1] R. Słowiński. Multiobjective network scheduling with efficient use of renewable and nonrenewable resources , 1981 .

[2] J. K. Lenstra,et al. Computational complexity of discrete optimization problems , 1977 .

[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .