Scheduling subject to resource constraints: Classification and complexity
Publication:1052820
DOI10.1016/0166-218X(83)90012-4zbMath0516.68037OpenAlexW2024742034WikidataQ57387938 ScholiaQ57387938MaRDI QIDQ1052820
Alexander H. G. Rinnooy Kan, Jan Karel Lenstra, Jacek Błażewicz
Publication date: 1983
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(83)90012-4
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (only showing first 100 items - show all)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deadline scheduling of tasks with ready times and resource constraints
- Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
- On the Computational Complexity of Combinatorial Problems
- Preemptive Scheduling of Uniform Processor Systems
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: Scheduling subject to resource constraints: Classification and complexity