Adjacent-Resource Scheduling

DOI10.1016/J.ENDM.2006.06.083MaRDI QIDQ3439486zbMATH OpenOpenAlexFDO

Authors Jacob Jan Paulus, Johann L. Hurink

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)

Cites work

• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Orthogonal Packings in Two Dimensions
• Project scheduling. A research handbook.

Cited in

(4)

• 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
• Exact and approximate methods for parallel multiple-area spatial scheduling with release times
• Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs

This page was built for publication: Adjacent-Resource Scheduling

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