C. Le Pape and P. Baptiste. Resource constraints for preemptive job-shop scheduling. CONSTRAINTS: An International Journal, 3(4), 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Constraint Logic Programming - Rossi (1999) (Correct)
....scheduling problems are those scheduling problems where activities may be interrupted over time. Also for these problems CLP technology has shown its potential: the CLAIRE SCHEDULE is a constraint programming library which can successfully handle these problems, also in the presence of preferences [133, 134]. By comparing the way scheduling problems are tackled by using imperative languages (C) generic CLP languages (CHIP) and specific constraint programming tools (CLP over sets) a recent study (on a specific scheduling problem: the cyclic hoist scheduling problem) has shown that the CLP approach ....
C. Le Pape and P. Baptiste. Resource constraints for preemptive job-shop scheduling. CONSTRAINTS: An International Journal, 3(4), 1998.
An Experimental Comparison of Constraint-Based Algorithms.. - Le Pape, Baptiste (1997) (2 citations) Self-citation (Le pape) (Correct)
....retaining or eliminating the best activity according to the heuristic. 4 Let us note that the improvement proposed in (Korf, 1996) would not apply well in our case, because the depth of the search tree varies a lot from a branch to another (even though it remains linear in the size of the problem) 8 0,00 2,00 4,00 6,00 8,00 10,00 12,00 14,00 16,00 1 2 3 4 5 6 7 8 9 10 Timetable DFS E JK Timetable DFS B JK Timetable LDS E JK Timetable LDS B JK Edge finder DFS E JK Edge finder DFS B JK Edge finder LDS E JK Edge finder LDS B JK Figure 1. Results on the ten instances used in ( Applegate ....
Le Pape, C. & Baptiste, Ph. (1997b). "Resource constraints for preemptive job-shop scheduling," Constraints, to appear.
Constraint Propagation Techniques for Cumulative Scheduling - Baptiste, Le Pape (1998) (1 citation) Self-citation (Le pape Baptiste) (Correct)
....= p i c i ; r 0 i = r i C; d 0 i = d i C) have to execute; where the term preemptive means that activities can be inetrrupted at any time. This is of great interest because very efficient constraint propagation algorithms have been built for preemptive resource constraints of capacity one ([1]) The resulting algorithm runs in O(n 2 ) 3 Energetic Reasoning We reuse the notion of required energy consumption defined in [5] The required energy consumption of an activity A i over an interval [t 1 t2 ] is c i times a lower bound of the number of time units during which A i executes ....
Claude Le Pape and Philippe Baptiste. Resource Constraints for Preemptive Job-Shop Scheduling. Constraints, 3(4), 1998.
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