C. Le Pape and P. Baptiste, A Constraint-Based Branch-and-Bound Algorithm for Preemptive Job-Shop Scheduling, Proc. of Int. Workshop on Production Planning and Control, Mons, Belgium, 1996. Home/Search Document Details and Download
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)
....every job i and a step j such that (j) m, job i uses m during all the time interval E j except for times when another job i such that i OE m i uses it. The following is a folk theorem, whose roots go back at least to [J55] with some reformulation and proofs in, for example, CP90, PB96] Theorem 1 (Efficiency is Good) Every preemptive job shop specification admits an efficient optimal schedule. Sketch of Proof: The proof is by showing that every inefficient schedule S can be transformed into an efficient schedule S with jS j jSj. Let I be the first interval when ....
....this 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 ....
[Article contains additional citation context not shown here]
C. Le Pape and P. Baptiste, A Constraint-Based Branch-and-Bound Algorithm for Preemptive Job-Shop Scheduling, Proc. of Int. Workshop on Production Planning and Control, Mons, Belgium, 1996.
Modelisation et Resolution de Problemes . . . - Maler (2002) Self-citation (Le pape) (Correct)
No context found.
C. Le Pape and P. Baptiste, A Constraint-Based Branch-and-Bound Algorithm for Preemptive Job-Shop Scheduling, Proc. of Int. Workshop on Production Planning and Control, Mons, Belgium, 1996.
A Theoretical And Experimental Study Of Resource . . . - Baptiste (1998) Self-citation (Baptiste Le pape) (Correct)
No context found.
Philippe Baptiste and Claude Le Pape [1996a]. A Constraint-Based Branch and Bound Algorithm for Preemptive Job-Shop Scheduling. Proceedings of the International Workshop on Production Planning and Control, Mons, Belgium, 1996.
A Constraint Programming Library for Preemptive and.. - Le Pape, Baptiste (1 citation) Self-citation (Baptiste Le pape) (Correct)
.... ) P a i n t i n g ( 2 ) M o v i n g ( 1 ) P l u m b i n g ( 8 ) C e i l i n g s ( 3 ) In these circumstances, it is easy to prove that if one of the two competing activities (plumbing or roofing) is given priority over the other at some time t, then the same priority can be applied at any time t [Baptiste Le Pape 96b] As a result, either plumbing or roofing can be scheduled to finish at its earliest end time according to the precedence constraints. Each of these two possibilities is tried in turn. In each case, the chosen activity is fixed in time and the timetable based propagation guarantees that the ....
....Activities may be interrupted at any time, an unlimited number of times. The problem is to find a schedule, i.e. a set of execution times for each activity, which minimizes the makespan, i.e. the time at which all activities are finished. The following table compares two similar algorithms (cf. Baptiste Le Pape 96b] the first one based on the mixed edge finder of CLAIRE SCHEDULE and the second on the GUTB algorithm of [Baptiste 95] on 20 well known job shop scheduling instances from the Literature. The first two columns indicate the algorithm that was used and the problem instance(s) under consideration. ....
[Article contains additional citation context not shown here]
Philippe Baptiste and Claude Le Pape. A Constraint-Based Branchand -Bound Algorithm for Preemptive Job-Shop Scheduling. Proceedings of the International Workshop on Production Planning and Control, Mons, Belgium, 1996.
Edge-Finding Constraint Propagation Algorithms for.. - Baptiste, Le Pape (1996) (5 citations) Self-citation (Baptiste Le pape) (Correct)
....the results obtained on the preemptive variants of the ten JSSP instances of [Applegate Cook 91] except ORB3 which remains open, with a lower bound of 971 and an upper bound of 973 for the optimal makespan. The algorithm used to solve the problem is a variant of the algorithm described in [Baptiste Le Pape 96] It is implemented in CLAIRE [Caseau Laburthe 96a] CPU times are expressed in seconds on a PC Dell GXL 5133, rounded to the closest tenth of a second. MAK BT CPU BT(pr) CPU(pr) MT10 900 140903 5659.5 41255 1679.0 ABZ5 1203 1192553 42172.8 338597 11943.0 ABZ6 924 17699 849.5 8157 366.9 LA19 ....
Ph. Baptiste and C. Le Pape. A Constraint-Based Branch-and-Bound Algorithm for Preemptive Job-Shop Scheduling. Proceedings of the International Workshop on Production Planning and Control, 1996.
Scheduling with Timed Automata - Abdeddaim, Maler (2003) (Correct)
No context found.
C. Le Pape and P. Baptiste, A Constraint-Based Branch-and-Bound Algorithm for Preemptive Job-Shop Scheduling, Proc. of Int. Workshop on Production Planning and Control, Mons, Belgium, 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