Sciweavers

2457 search results - page 425 / 492
» Local Search with Bootstrapping
Sort
View
ANOR
2007
80views more  ANOR 2007»
15 years 4 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
128
Voted
COR
2010
155views more  COR 2010»
15 years 4 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...
CGF
2008
129views more  CGF 2008»
15 years 4 months ago
Caustic Forecasting: Unbiased Estimation of Caustic Lighting for Global Illumination
We present an unbiased method for generating caustic lighting using importance sampled Path Tracing with Caustic Forecasting. Our technique is part of a straightforward rendering ...
B. C. Budge, John C. Anderson, Kenneth I. Joy
COR
2010
119views more  COR 2010»
15 years 4 months ago
Algorithms for a realistic variant of flowshop scheduling
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...
B. Naderi, Rubén Ruiz, M. Zandieh
COR
2008
111views more  COR 2008»
15 years 4 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song