Sciweavers

146 search results - page 19 / 30
» A hybrid constraint programming approach to the log-truck sc...
Sort
View
78
Voted
EOR
2008
110views more  EOR 2008»
14 years 9 months ago
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
85
Voted
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
15 years 1 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang
CP
2005
Springer
15 years 3 months ago
On Solving Soft Temporal Constraints Using SAT Techniques
In this paper, we present an algorithm for finding utilitarian optimal solutions to Simple and Disjunctive Temporal Problems with Preferences (STPPs and DTPPs) based on Benders’...
Hossein M. Sheini, Bart Peintner, Karem A. Sakalla...
CP
2004
Springer
15 years 2 months ago
The Cardinality Matrix Constraint
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
Jean-Charles Régin, Carla P. Gomes
CPAIOR
2008
Springer
14 years 11 months ago
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Tino Teige, Martin Fränzle