Matches in SemOpenAlex for { <https://semopenalex.org/work/W2075101107> ?p ?o ?g. }
Showing items 1 to 82 of
82
with 100 items per page.
- W2075101107 endingPage "262" @default.
- W2075101107 startingPage "248" @default.
- W2075101107 abstract "Abstract We 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" @default.
- W2075101107 created "2016-06-24" @default.
- W2075101107 creator A5080740476 @default.
- W2075101107 creator A5081910021 @default.
- W2075101107 date "2012-08-28" @default.
- W2075101107 modified "2023-10-10" @default.
- W2075101107 title "Integrated job scheduling and network routing" @default.
- W2075101107 cites W1970355999 @default.
- W2075101107 cites W1972437117 @default.
- W2075101107 cites W2024099542 @default.
- W2075101107 cites W2031722814 @default.
- W2075101107 cites W2038700684 @default.
- W2075101107 cites W2070355292 @default.
- W2075101107 cites W2076171427 @default.
- W2075101107 cites W2103363198 @default.
- W2075101107 cites W2105560970 @default.
- W2075101107 cites W2149705873 @default.
- W2075101107 cites W2161215264 @default.
- W2075101107 cites W2162041888 @default.
- W2075101107 cites W2177551934 @default.
- W2075101107 cites W4244424643 @default.
- W2075101107 doi "https://doi.org/10.1002/net.21479" @default.
- W2075101107 hasPublicationYear "2012" @default.
- W2075101107 type Work @default.
- W2075101107 sameAs 2075101107 @default.
- W2075101107 citedByCount "2" @default.
- W2075101107 countsByYear W20751011072014 @default.
- W2075101107 countsByYear W20751011072020 @default.
- W2075101107 crossrefType "journal-article" @default.
- W2075101107 hasAuthorship W2075101107A5080740476 @default.
- W2075101107 hasAuthorship W2075101107A5081910021 @default.
- W2075101107 hasConcept C111919701 @default.
- W2075101107 hasConcept C114809511 @default.
- W2075101107 hasConcept C126255220 @default.
- W2075101107 hasConcept C127705205 @default.
- W2075101107 hasConcept C168956720 @default.
- W2075101107 hasConcept C170334043 @default.
- W2075101107 hasConcept C187691185 @default.
- W2075101107 hasConcept C206729178 @default.
- W2075101107 hasConcept C2524010 @default.
- W2075101107 hasConcept C33923547 @default.
- W2075101107 hasConcept C41008148 @default.
- W2075101107 hasConcept C41045048 @default.
- W2075101107 hasConcept C55416958 @default.
- W2075101107 hasConcept C56086750 @default.
- W2075101107 hasConcept C68387754 @default.
- W2075101107 hasConceptScore W2075101107C111919701 @default.
- W2075101107 hasConceptScore W2075101107C114809511 @default.
- W2075101107 hasConceptScore W2075101107C126255220 @default.
- W2075101107 hasConceptScore W2075101107C127705205 @default.
- W2075101107 hasConceptScore W2075101107C168956720 @default.
- W2075101107 hasConceptScore W2075101107C170334043 @default.
- W2075101107 hasConceptScore W2075101107C187691185 @default.
- W2075101107 hasConceptScore W2075101107C206729178 @default.
- W2075101107 hasConceptScore W2075101107C2524010 @default.
- W2075101107 hasConceptScore W2075101107C33923547 @default.
- W2075101107 hasConceptScore W2075101107C41008148 @default.
- W2075101107 hasConceptScore W2075101107C41045048 @default.
- W2075101107 hasConceptScore W2075101107C55416958 @default.
- W2075101107 hasConceptScore W2075101107C56086750 @default.
- W2075101107 hasConceptScore W2075101107C68387754 @default.
- W2075101107 hasIssue "3" @default.
- W2075101107 hasLocation W20751011071 @default.
- W2075101107 hasOpenAccess W2075101107 @default.
- W2075101107 hasPrimaryLocation W20751011071 @default.
- W2075101107 hasRelatedWork W1556053881 @default.
- W2075101107 hasRelatedWork W2032436423 @default.
- W2075101107 hasRelatedWork W2114164426 @default.
- W2075101107 hasRelatedWork W2131559541 @default.
- W2075101107 hasRelatedWork W2266046735 @default.
- W2075101107 hasRelatedWork W2911906655 @default.
- W2075101107 hasRelatedWork W3141113327 @default.
- W2075101107 hasRelatedWork W4231500168 @default.
- W2075101107 hasRelatedWork W4387035774 @default.
- W2075101107 hasRelatedWork W90079504 @default.
- W2075101107 hasVolume "61" @default.
- W2075101107 isParatext "false" @default.
- W2075101107 isRetracted "false" @default.
- W2075101107 magId "2075101107" @default.
- W2075101107 workType "article" @default.