Sciweavers

55 search results - page 4 / 11
» orl 2008
Sort
View
ORL
2008
67views more  ORL 2008»
14 years 11 months ago
Bounds on the performance of back-to-front airplane boarding policies
We provide bounds on the performance of back-to-front airplane boarding policies. In particular, we show that no back-to-front policy can be more than 20% better than the policy w...
Eitan Bachmat, Michael Elkin
ORL
2008
112views more  ORL 2008»
14 years 11 months ago
A monotone approximation algorithm for scheduling with precedence constraints
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
Sven Oliver Krumke, Anne Schwahn, Rob van Stee, St...
ORL
2008
86views more  ORL 2008»
14 years 10 months ago
Searching the k-change neighborhood for TSP is W[1]-hard
We show that searching the k-change neighborhood is W[1]-hard for metric TSP, which means that finding the best tour in the k-change neighborhood essentially requires complete sea...
Dániel Marx
ORL
2008
115views more  ORL 2008»
14 years 10 months ago
On the convergence of stochastic dual dynamic programming and related methods
We discuss the almost-sure convergence of a broad class of sampling algorithms for multi-stage stochastic linear programs. We provide a convergence proof based on the finiteness o...
Andrew B. Philpott, Z. Guan
ORL
2008
87views more  ORL 2008»
14 years 9 months ago
On-line scheduling with non-crossing constraints
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Lele Zhang, Kwanniti Khammuang, Andrew Wirth