P. Baptiste and C. Le Pape. Constraint Propagation Techniques for Cumulative Scheduling. In Proceedings of the First Workshop on the Integration of AI and OR Thechniques in Constraint Programming for Combinatorial Optimization Problems, Ferrara, Italy, 1999.  Home/Search   Document Details and Download   Summary   Related Articles

....technique is introduced, forming a variant of ESTA that is shown to be quite powerful on highly constrained problems. 1 Introduction A number of efforts have recently focused on development of CSP scheduling algorithms for problems with cumulative resources (i.e. multi capacity resources) [1, 9] and generalized precedence relations (i.e. maximum and minimum metric separation constraints between activities) 6, 10] Dealing with such expressive modeling extensions provides a better match to real life situations and avoids abstracting away relevant aspects of practical scheduling ....

....one unit of capacity, the number of mcss in a given peak is actually quite high. For example, if a peak contains 20 activities and the resource capacity is 5, the number of mcss is Gamma 20 = 38760 . However, we can expect that the associated values of K are distributed in the interval [0,1]. Hence it is reasonable to assume that there are several mcss with maximal values of K, as well as a number of mcss with values of K quite close to the maximal. If one of these mcss could be efficiently computed it would clearly constitute a critical mcs and likely be a good heuristic choice. To ....

P. Baptiste and C. Le Pape. Constraint Propagation Techniques for Cumulative Scheduling. In Proceedings of the First Workshop on the Integration of AI and OR Thechniques in Constraint Programming for Combinatorial Optimization Problems, Ferrara, Italy, 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC