Integrated job scheduling and network routing

AbstractWe consider an integrated job scheduling and network routing problem which appears in Grid Computing and production planning. The problem is to schedule a number of jobs at a finite set of machines, such that the overall profit of the executed jobs is maximized. Each job demands a number of resources which must be sent to the executing machine through a network with limited capacity. A job cannot start before all of its resources have arrived at the machine.The scheduling problem is formulated as a Mixed Integer Program (MIP) and proved to be \documentclass{article} \usepackage{amsmath,amsfonts, amssymb}\pagestyle{empty}\begin{document} $\mathcal{NP}$ \end{document} ‐hard. An exact solution approach using Dantzig‐Wolfe decomposition is presented. The pricing problem is the linear multicommodity flow problem defined on a time‐space network. Branching strategies are presented for the branch‐and‐price algorithm and three heuristics and an exact solution method are implemented for finding a feasible start solution. Finally, interior point stabilization is used to decrease the number of columns generated in the branch‐and‐price algorithm.The algorithm is experimentally evaluated on job scheduling instances for a Grid network. The Dantzig‐Wolfe algorithm with stabilization is clearly superior, being able to solve large instances with 1,000 jobs and 1,000 machines covering 24 hours of scheduling activity on a Grid network. The algorithm is also compared to simulations of a real‐life Grid, and results show that the solution quality significantly increases when solving the problem to optimality. The promising results indicate that the algorithm can be used as an actual scheduling algorithm in the Grid or as a tool for analyzing Grid performance when adding extra machines or jobs. © 2012 Wiley Periodicals, Inc. NETWORKS, 2013