Sciweavers

1102 search results - page 31 / 221
» Dynamic Constraint Models for Planning and Scheduling Proble...
Sort
View
CORR
2007
Springer
120views Education» more  CORR 2007»
13 years 9 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová
ICALP
2007
Springer
14 years 3 months ago
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
ATAL
2009
Springer
14 years 3 months ago
On the complexity of schedule control problems for knockout tournaments
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
Thuc Vu, Alon Altman, Yoav Shoham
GECCO
2006
Springer
190views Optimization» more  GECCO 2006»
14 years 24 days ago
Effective genetic approach for optimizing advanced planning and scheduling in flexible manufacturing system
In this paper, a novel approach for designing chromosome has been proposed to improve the effectiveness, which called multistage operation-based genetic algorithm (moGA). The obje...
Haipeng Zhang, Mitsuo Gen
CPAIOR
2009
Springer
14 years 3 months ago
Sequencing and Counting with the multicost-regular Constraint
This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems...
Julien Menana, Sophie Demassey