A branch & bound algorithm for the open-shop problem
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Computers and Operations Research
Planning with sharable resource constraints
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Modelling for lazy clause generation
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Global difference constraint propagation for finite domain solvers
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Agent-Based Approach to Solving the Resource Constrained Project Scheduling Problem
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Compiling finite linear CSP into SAT
Constraints
Propagation via lazy clause generation
Constraints
Proactive algorithms for job shop scheduling with probabilistic durations
Journal of Artificial Intelligence Research
Handling alternative activities in resource-constrained project scheduling problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Extending the RCPSP for modeling and solving disruption management problems
Applied Intelligence
Propagation = lazy clause generation
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A precedence constraint posting approach for the RCPSP with time lags and variable durations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Why cumulative decomposition is not as bad as it sounds
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Event-based MILP models for resource-constrained project scheduling problems
Computers and Operations Research
Project Scheduling as a Disjunctive Temporal Problem
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
Proceedings of the Conference on Design, Automation and Test in Europe
Constraint based scheduling to deal with uncertain durations and self-timed execution
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Explaining the cumulative propagator
Constraints
Precedence constraint posting for cyclic scheduling problems
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Timetable edge finding filtering algorithm for discrete cumulative resources
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Compiling finite linear CSP into SAT
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
Mathematical and Computer Modelling: An International Journal
An Optimal Constraint Programming Approach to the Open-Shop Problem
INFORMS Journal on Computing
Hi-index | 0.00 |
This paper describes a simple complete search for cumulative scheduling based on the detection and resolution of minimal critical sets (MCS). The heuristic for selecting MCSs relies on an estimation of the related reduction of the search space. An extension of the search procedure using self-adapting shaving is proposed. The approach was implemented on top of classical constraint propagation algorithms and tested on resource constrained project scheduling problems (RCPSP). We were able to close more than 15% of the previously open problems of the PSPLIB [Kolisch and Sprecher, 1996] and improve more than 31% of the best known lower bounds on those heavily studied problems. Other new results on open-shop and cumulative job-shop scheduling are reported.