On the complexity of adjacent resource scheduling
From MaRDI portal
Publication:880528
DOI10.1007/s10951-006-5593-6zbMath1154.90443OpenAlexW1971702637MaRDI QIDQ880528
Erik Van der Sluis, Cees W. Duin
Publication date: 15 May 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://pure.uva.nl/ws/files/1319006/96102_333fulltext.pdf
Related Items (11)
Scheduling under the network of temporo-spatial proximity relationships ⋮ Exact and approximate methods for parallel multiple-area spatial scheduling with release times ⋮ Resource allocation with time intervals ⋮ Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ On minimizing dataset transfer time in an acyclic network with four servers ⋮ Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width ⋮ Ship Traffic Optimization for the Kiel Canal ⋮ Batching-Based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem ⋮ Handling precedence constraints in scheduling problems by the sequence pair representation ⋮ Time-constrained project scheduling with adjacent resources
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of scheduling independent two-processor tasks on dedicated processors
- Scheduling multiprocessor tasks on three dedicated processors
- Scheduling multiprocessor tasks -- An overview
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Complexity of Scheduling Parallel Task Systems
- The NP-Completeness of Edge-Coloring
- Scheduling independent multiprocessor tasks
This page was built for publication: On the complexity of adjacent resource scheduling
