Sciweavers

1292 search results - page 129 / 259
» Revisiting the optimal scheduling problem
Sort
View
CPAIOR
2008
Springer
15 years 8 months ago
Gap Reduction Techniques for Online Stochastic Project Scheduling
Anticipatory algorithms for online stochastic optimization have been shown very effective in a variety of areas, including logistics, reservation systems, and scheduling. For such ...
Grégoire Dooms, Pascal Van Hentenryck
199
Voted
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 11 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
FOCS
2000
IEEE
15 years 9 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
COR
2010
177views more  COR 2010»
15 years 6 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
GECCO
1999
Springer
126views Optimization» more  GECCO 1999»
15 years 10 months ago
Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling)
Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the sea...
Stephen Y. Chen, Stephen F. Smith