Scheduling subject to nonrenewable-resource constraints

Authors:
J. Carlier;A. H. G. Rinnooy Kan
Affiliations:
Université de Pierre et Marie Curie, 4 Place Jussieu, 75230 Paris Cédex 05, France;Econometrisch Instituut, Erasmus University, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands
Venue:
Operations Research Letters
Year:
1982

Citing 1
Cited 3

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Polynomial algorithms for single machine scheduling problems with financial constraints

Operations Research Letters
Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times

Journal of Scheduling
Approximation schemes for single machine scheduling with non-renewable resource constraints

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.