55 search results - page 4 / 11 » orl 2008 |
55
Voted
ORL
2008
15 years 22 days ago
2008
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...
109
Voted
ORL
2008
15 years 22 days ago
2008
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
97
Voted
ORL
2008
15 years 7 days ago
2008
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...
ORL
2008
15 years 7 days ago
2008
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...
94
Voted
ORL
2008
14 years 11 months ago
2008
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...