Adjacent-Resource Scheduling

DOI10.1016/j.endm.2006.06.083zbMath1134.90425OpenAlexW2161955775MaRDI QIDQ3439486

Johann L. Hurink, Jacob Jan Paulus

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.083

zbMATH Keywords

complexityonline schedulingRCPSPspatial resource

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Exact and approximate methods for parallel multiple-area spatial scheduling with release times ⋮ 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

Cites Work

• Unnamed Item
• Project scheduling. A research handbook.
• Orthogonal Packings in Two Dimensions
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Adjacent-Resource Scheduling