SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS: CLASSIFICATION AND COMPLEXITY

J. Blazewicz, J. K. Lenstra and A. H. G. Rinnooy Kan

No 272264, Econometric Institute Archives from Erasmus University Rotterdam

Abstract: In deterministic sequencing and scheduling problems, jobs are to be processed on machines of limited capacity. We consider an extension of this class of problems, in which the jobs require the use of additional scarce resources during their execution. A classification scheme for resource constraints is proposed and the computational complexity of the extended problem class is investigated in terms of this classification. Models involving parallel machines, unit-time jobs and the maximum completion time criterion are studied in detail; other models are briefly discussed.

Keywords: Agricultural and Food Policy; Research Methods/Statistical Methods (search for similar items in EconPapers)
Pages: 21
Date: 1980
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://ageconsearch.umn.edu/record/272264/files/erasmus140.pdf (application/pdf)
https://ageconsearch.umn.edu/record/272264/files/erasmus140.pdf?subformat=pdfa (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ags:eureia:272264

DOI: 10.22004/ag.econ.272264

Access Statistics for this paper

More papers in Econometric Institute Archives from Erasmus University Rotterdam Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search ().