๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Scheduling subject to resource constraints: classification and complexity

โœ Scribed by J. Blazewicz; J.K. Lenstra; A.H.G.Rinnooy Kan

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
822 KB
Volume
5
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Uniform machine scheduling of unit-time
Uniform machine scheduling of unit-time jobs subject to resource constraints
โœ Mikhail Y. Kovalyov; Yakov M. Shafransky ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 350 KB

The problem of scheduling a set of unit-time jobs on M uniform machines is studied. Some jobs may require a unit of an additional single resource during their execution. The resource is renewable but the total resource consumption is limited by the same value at each time instant. The objective is t

Single machine scheduling problems with
Single machine scheduling problems with financial resource constraints: Some complexity results and properties
โœ Evgeny R. Gafarov; Alexander A. Lazarev; Frank Werner ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 259 KB

We consider single machine scheduling problems with a non-renewable resource. These types of problems have not been intensively investigated in the literature so far. For several problems of these types with standard objective functions (namely the minimization of makespan, total tardiness, number o