Sciweavers

703 search results - page 4 / 141
» Maintenance scheduling problems as benchmarks for constraint...
Sort
View
CPAIOR
2004
Springer
13 years 11 months ago
A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
Christian Artigues, Sana Belmokhtar, Dominique Fei...
AIPS
2006
13 years 7 months ago
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...
Roman Barták, Ondrej Cepek
AAMAS
2011
Springer
13 years 1 months ago
Benchmarking hybrid algorithms for distributed constraint optimisation games
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...
Archie C. Chapman, Alex Rogers, Nicholas R. Jennin...
EOR
2007
77views more  EOR 2007»
13 years 6 months ago
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...
Jorge Maturana, María-Cristina Riff
ANOR
2008
171views more  ANOR 2008»
13 years 6 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet