Integrating job scheduling and constrained network routing

DOI10.1016/J.ENDM.2010.05.008MaRDI QIDQ2883550zbMATH OpenOpenAlexFDO

Authors M. Gamst

Publication date 13 May 2012

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

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

zbMATH Keywords

heuristicgrid computingbranch-and-pricejob schedulingnetwork routing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Exact and heuristic solution approaches for the integrated job scheduling and constrained network routing problem
• Integrated job scheduling and network routing
• Maximizing business value by optimal assignment of jobs to resources in grid computing
• Bandwidth-constrained allocation in grid computing.
• Bandwidth-constrained allocation in grid computing

Cited in

(9)

• Scheduling independent jobs for torus connected networks with/without link contention.
• Maximizing business value by optimal assignment of jobs to resources in grid computing
• Communication contention reduction in joint scheduling for optical grid computing
• Joint scheduling of tasks and communication in WDM optical networks for supporting grid computing
• scientific article; zbMATH DE number 2222917 (Why is no real title available?)
• Bandwidth-constrained allocation in grid computing.
• Integrated job scheduling and network routing
• Exact and heuristic solution approaches for the integrated job scheduling and constrained network routing problem
• Optimizing Routing and Backlogs for Job Flows in a Distributed Computing Environment

This page was built for publication: Integrating job scheduling and constrained network routing

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