Three mechanisms for managing resource constraints in a library for constraint-based scheduling

• Published in: Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95 Vol. 1; pp. 281 - 289 vol.1
• Main Author: Le Pape, C.
• Format: Conference Proceeding
• Language: English
• Published: Los Alamitos CA IEEE 1995; IEEE Computer Society Press
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Artificial intelligence; Computer science; control theory; systems; Control theory. Systems; Exact sciences and technology; Learning and adaptive systems; Libraries; NP-hard problem; Object oriented programming; Process control. Computer integrated manufacturing; Production facilities; Resource management; Theoretical computing; Production system; Software tool; Propagation; Constraint; Industrial application; Use; Object oriented; Information processing; Scheduling; Resource management; Computational complexity
• ISBN: 9780780325357; 0780325354
• DOI: 10.1109/ETFA.1995.496781

ILOG SCHEDULE is a C++ library aimed at simplifying the development of industrial scheduling applications. SCHEDULE is based on SOLVER, a generic tool for object-oriented constraint programming. SCHEDULE includes three categories of predefined constraints: temporal constraints, capacity constraints, and resource utilization constraints. Three distinct mechanisms are available to deal with resource utilization constraints. The first mechanism relies on explicit time-tables to maintain information about the variations of resource utilization and resource availability over time. The second mechanism relies on a generic disjunctive constraint which ensures that incompatible activities (for example, activities which require a common resource of capacity 1) cannot overlap in time. The third mechanism, known as edge-finding, considers arbitrary tuples {A/sub 1/...A/sub n/} of activities to prove that some activity A/sub i/ must execute first, or must execute last, among {A/sub 1/...A/sub n/}. The edge-finding mechanism is a priori more CPU-time consuming than the two other mechanisms, but results in the assignment of more precise earliest and latest start and end times to activities. Each of the three mechanisms is useful, as the time-table and disjunctive mechanisms enable the expression of wider classes of constraints, while edge-finding is in general the most effective in pruning the search space.