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

DOI10.1016/J.DAM.2011.07.011zbMATH Open1329.68054OpenAlexW1990119595MaRDI QIDQ496641FDOQ496641

Authors: M. 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

Recommendations

• Integrating job scheduling and constrained network routing
• Integrated job scheduling and network routing
• scientific article; zbMATH DE number 15416
• Scheduling in network flow shops
• Task scheduling in networks

zbMATH Keywords

heuristicsgrid computingcolumn generationjob schedulingrouting and wavelength assignmentDantzig-Wolfe decomposition

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms.
• Finding the k Shortest Paths
• Decomposition Principle for Linear Programs
• Interior point stabilization for column generation
• Integrated job scheduling and network routing

Cited In (1)

• Integrated job scheduling and network routing

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

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