C. Le Pape and P. Baptiste, An Experimental Comparaison of Constraint-Based Algorithms for the Preemptive Job-shop Sheduling Problem, CP97 Workshop on Industrial ConstraintDirected Scheduling, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Preemptive Job-Shop Scheduling using Stopwatch Automata - Abdeddaim, Maler (2002) (2 citations) (Correct)
....heuristics we took 16 problems among the most notorious job shop scheduling problems. Note that these are pathological problems with a large variability in The problems are taken from ftp: mscmga.ms.ic.ac. uk pub jobshop1.txt problem non preempt preemptive name #j #m optimum optimum [PB96, PB97] stopwatch deviation LA02 10 5 655 655 655 655 0 FT10 10 10 930 900 900 911 1.21 ABZ5 10 10 1234 1203 1206 1250 3.76 ABZ6 10 10 943 924 924 936 1.28 ORB1 10 10 1059 1035 1035 1093 5.31 ORB2 10 10 888 864 864 884 2.26 ORB3 10 10 1005 973 994 1013 3.95 ORB4 10 10 1005 980 980 ....
....scheduling. For each of these problems we have applied our algorithms for different choices of w, both forward and backward (it takes, on the average few minutes for each problem) In Table 4 we compare our best results on these problems to recent results reported by Le Pape and Baptiste [PB96, PB97] where the problem was solved using state of the art constraint satisfaction techniques. As the table shows, the results our first prototype are very close to the optimum. 5 Conclusion We have demonstrated that the automata theoretic approach to scheduling can be extended to preemptive ....
C. Le Pape and P. Baptiste, An Experimental Comparaison of Constraint-Based Algorithms for the Preemptive Job-shop Sheduling Problem, CP97 Workshop on Industrial Constraint-Directed Scheduling, 1997. 13
Modelisation et Resolution de Problemes . . . - Maler (2002) Self-citation (Le pape) (Correct)
No context found.
C. Le Pape and P. Baptiste, An Experimental Comparaison of Constraint-Based Algorithms for the Preemptive Job-shop Sheduling Problem, CP97 Workshop on Industrial Constraint-Directed Scheduling, 1997.
Scheduling with Timed Automata - Abdeddaim, Maler (2003) (Correct)
No context found.
C. Le Pape and P. Baptiste, An Experimental Comparaison of Constraint-Based Algorithms for the Preemptive Job-shop Sheduling Problem, CP97 Workshop on Industrial ConstraintDirected Scheduling, 1997.
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