Applications of CHIP to industrial and engineering problems
IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Solving large combinatorial problems in logic programming
Journal of Logic Programming - Logic programming applications
Object-oriented interaction in resource constrained scheduling
Information Processing Letters
A dynamic algorithm for placing rectangles without overlapping
Journal of Information Processing
A heuristic problem solving design system for equipment or furniture layouts
Communications of the ACM
Introducing global constraints in CHIP
Mathematical and Computer Modelling: An International Journal
Strong polynomiality of resource constraint propagation
Discrete Optimization
Maximising the net present value for resource-constrained project scheduling
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Scheduling scientific experiments on the rosetta/philae mission
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A scalable sweep algorithm for the cumulative constraint
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Constraint-Based register allocation and instruction scheduling
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Solving RCPSP/max by lazy clause generation
Journal of Scheduling
Optimal rectangle packing: an absolute placement approach
Journal of Artificial Intelligence Research
On the complexity of global scheduling constraints under structural restrictions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Product and Production Process Modeling and Configuration
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.98 |
In this paper, we show how the introduction of a new primitive constraint over finite domains in the constraint logic programming system CHIP allows us to find very good solutions for a large class of very difficult scheduling and placement problems. Examples on the cumulative scheduling problem, the 10 jobs x 10 machines problem, the perfect square problem, the strip packing problem and the incomparable rectangles packing problem are given, showing the versatility, the efficiency and the broad range of application of this new constraint. We point out that no other existing approach can address simultaneously all the problems discussed in this paper.