Sciweavers

1125 search results - page 65 / 225
» On the job rotation problem
Sort
View
EOR
2007
80views more  EOR 2007»
13 years 10 months ago
The tool switching problem revisited
In this note we study the tool switching problem with non-uniform tool sizes. More specifically, we consider the problem where the job sequence is given as part of the input. We ...
Yves Crama, Linda S. Moonen, Frits C. R. Spieksma,...
IEAAIE
2005
Springer
14 years 3 months ago
Structural Advantages for Ant Colony Optimisation Inherent in Permutation Scheduling Problems
When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the...
James Montgomery, Marcus Randall, Tim Hendtlass
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
14 years 1 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 11 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
ECCV
2008
Springer
14 years 12 months ago
Belief Propagation with Directional Statistics for Solving the Shape-from-Shading Problem
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
Tom S. F. Haines, Richard C. Wilson