On the complexity of adjacent resource scheduling

DOI10.1007/S10951-006-5593-6MaRDI QIDQ880528zbMATH OpenOpenAlexFDO

Authors Cees Duin, Erik Van der Sluis

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

zbMATH Keywords

combinatorial optimizationinteger programmingstrip packingmultiprocessor scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 3891075
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Staff and resource scheduling at airports
• Scheduling of time-shared jet aircraft
• On the computational complexity of (maximum) class scheduling

Cites work

• scientific article; zbMATH DE number 1302193 (Why is no real title available?)
• A polynomial time approximation scheme for general multiprocessor job scheduling
• A typology of cutting and packing problems
• Complexity of Scheduling Parallel Task Systems
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Operations scheduling with applications in manufacturing and services. With 3.5 disk package
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling independent multiprocessor tasks
• Scheduling multiprocessor tasks -- An overview
• Scheduling multiprocessor tasks on three dedicated processors
• The NP-Completeness of Edge-Coloring
• The complexity of scheduling independent two-processor tasks on dedicated processors
• Two-dimensional packing problems: a survey

Cited in

(12)

• Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Batching-based approaches for optimized packing of jobs in the spatial scheduling problem
• Scheduling under the network of temporo-spatial proximity relationships
• On minimizing dataset transfer time in an acyclic network with four servers
• Resource allocation with time intervals
• Exact and approximate methods for parallel multiple-area spatial scheduling with release times
• Handling precedence constraints in scheduling problems by the sequence pair representation
• Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs
• Ship traffic optimization for the Kiel Canal
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
• Time-constrained project scheduling with adjacent resources

This page was built for publication: On the complexity of adjacent resource scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880528)