Artificial Intelligence - Special issue on knowledge representation
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Single Machine Scheduling with Release Dates
SIAM Journal on Discrete Mathematics
Embedding Relaxations in Global Constraints for Solving TSP and TSPTW
Annals of Mathematics and Artificial Intelligence
Optimization-Oriented Global Constraints
Constraints
Arc Consistency for Global Cardinality Constraints with Costs
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A new constraint programming approach for the orthogonal packing problem
Computers and Operations Research
A Global Constraint for Total Weighted Completion Time
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Determining manufacturing parameters to suppress system variance using linear and non-linear models
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage assignment in warehouses. These applications often necessitate considering a rich set of requirements and preferences, which makes constraint programming (CP) an effective modeling and solving approach. On the other hand, basic CP techniques can be inefficient in solving models that require inference over sum type expressions. In this paper, we address increasing the solution efficiency of constraint-based approaches to cumulative resource scheduling with the above criterion. Extending previous results for unary capacity resources, we define the COMPLETION"m global constraint for propagating the total weighted completion time of activities that require the same cumulative resource. We present empirical results in two different problem domains: scheduling a single cumulative resource, and container loading with constraints on the location of the center of gravity. In both domains, the proposed constraint propagation algorithm out-performs existing propagation techniques.