Jacques Carlier and Eric Pinson. Jackson Pseudo Preemptive Schedule for the (Pmjr i ; q i jCmax) Problem. To appear in Annals of Operations Research, 1996. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Constraint Propagation Techniques for Cumulative Scheduling - Baptiste, Le Pape (1998) (1 citation) (Correct)
....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 described in [3] show that the constraint propagation techniques described in this paper are worthwhile for some (but not all) classes of cumulative scheduling problems. We have been able to identify that when many ....
Jacques Carlier and Eric Pinson. Jackson Pseudo Preemptive Schedule for the (Pmjr i ; q i jCmax) Problem. To appear in Annals of Operations Research, 1996.
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