Exact and heuristic solution approaches for the integrated job scheduling and constrained network routing problem

DOI10.1016/j.dam.2011.07.011zbMath1329.68054OpenAlexW1990119595MaRDI QIDQ496641

Mette Gamst

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.07.011

zbMATH Keywords

heuristicscolumn generationDantzig-Wolfe decompositionjob schedulinggrid computingrouting and wavelength assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Integrated job scheduling and network routing

Cites Work

• Interior point stabilization for column generation
• Decomposition Principle for Linear Programs
• Finding the k Shortest Paths
• Integrated job scheduling and network routing
• Unnamed Item

This page was built for publication: Exact and heuristic solution approaches for the integrated job scheduling and constrained network routing problem