Sciweavers

1719 search results - page 289 / 344
» Scheduling with soft constraints
Sort
View
AAAI
1997
13 years 10 months ago
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
Roberto J. Bayardo Jr., Robert Schrag
CPAIOR
2009
Springer
13 years 10 months ago
Max Energy Filtering Algorithm for Discrete Cumulative Resources
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...
Petr Vilím
EOR
2008
93views more  EOR 2008»
13 years 8 months ago
A survey of surface mount device placement machine optimisation: Machine classification
The optimisation of a printed circuit board assembly line is mainly influenced by the constraints of the surface mount device (SMD) placement machine and the characteristics of th...
Masri Ayob, Graham Kendall
EOR
2008
140views more  EOR 2008»
13 years 8 months ago
Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
Christine Solnon
HEURISTICS
2006
197views more  HEURISTICS 2006»
13 years 8 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa