Philippe Baptiste, Claude Le Pape and Wim Nuijten Satisfiability Tests and Time-Bound Adjustments for Cumulative Scheduling Problems. Technical Report 97-98, University of Compi`egne, 1997. To appear in Annals of Operations Research.  Home/Search   Document Not in Database   Summary   Related Articles

....process. We briefly present three resource constraint propagation algorithms that have been developped for cumulative scheduling. The first one is based upon a transformation into a preemptive one machine problem while the second and the third ones are based upon energetic reasoning. We reefer to [2] for more details on the results presented in the following. 2 Preemptive Transformation Let R be a resource and let C be its capacity. For each activity A i , we note c i the amount of R used throughout its execution. From now on, we relax all precedence constraints, and all resource constraints ....

....consumptions exceeds the available resource energy (C (t2 Gamma t1 ) then the problem is inconsistent. Moreover, it is easy to adjust time windows thanks to energy based reasoning. 4 Theoretical and Experimental Comparison The three constraint propagation schemes have been compared in [2]. The one based on the second energetic lower bound dominates all the other ones. Moreover, it strictly dominates several well known operations research lower bounds such as Jackson Pseudo Preemptive Schedule [4] or the subset bound. From a practical point of view, the experimental results ....

Philippe Baptiste, Claude Le Pape and Wim Nuijten Satisfiability Tests and Time-Bound Adjustments for Cumulative Scheduling Problems. Technical Report 97-98, University of Compi`egne, 1997. To appear in Annals of Operations Research.

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