Preemptive job-shop scheduling using stopwatch automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2280, Issue , 2002, Pages 113-126

  Abdeddaïm, Yasmina ^a   Maler, Oded ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE SUBSETS; JOB-SHOP SCHEDULING; OPTIMAL SCHEDULE; SHORTEST PATH; SHORTEST PATH PROBLEM; STOPWATCH AUTOMATA; TIMED AUTOMATA; VERIFICATION PROBLEMS;

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; STOP WATCHES; TOOLS;

AUTOMATA THEORY;

EID: 84888242890     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-46002-0_9     Document Type: Article

References (18)

1. Y. Abdeddaïm and O. Maler, Job-Shop Scheduling using Timed Automata. In G. Berry, H. Comon and A. Finkel (Eds.), Proc. CAV'01, 478-492, LNCS 2102, Springer 2001.
2. K. Altisen, G. Goessler, A. Pnueli, J. Sifakis, S. Tripakis and S. Yovine, A Framework for Scheduler Synthesis, Proc. RTSS'99, 154-163, IEEE, 1999.
3. R. Alur and D.L. Dill, A Theory of Timed Automata, Theoretical Computer Science 126, 183-235, 1994.
4. E. Asarin and O. Maler, As Soon as Possible: Time Optimal Control for Timed Automata, Proc. HSCC'99, 19-30, LNCS 1569, Springer, 1999.
5. G. Behrmann, A. Fehnker T.S. Hune, K.G. Larsen, P. Pettersson and J. Romijn, Efficient Guiding Towards Cost-Optimality in UPPAAL, Proc. TACAS 2001, 174-188, LNCS 2031, Springer, 2001.
6. J. Carlier and E. Pinson, A Practical Use of Jackson's Preemptive Schedule for Solving the Job-Shop Problem, Annals of Operations Research 26, 1990.
7. F. Cassez and K.G. Larsen, On the Impressive Power of Stopwatches. In C. Palamidessi (Ed.) Proc. CONCUR'2000, 138-152, LNCS 1877, Springer, 2000.
8. K. Cerans, Algorithmic Problems in Analysis of Real Time System Specifications, Ph.D. thesis, University of Latvia, Riga, 1992.
9. E. Fersman, P. Pettersson and W. Yi, Timed Automata with Asynchronous Processes: Schedulability and Decidability, TACAS 2002, this volume, 2002.
10. M.R. Garey and D. S Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979.
11. J. R. Jackson, Scheduling a Production Line to Minimize Maximum Tardiness, Research Report 43, Management Sciences Research Project, UCLA, 1955.
12. A.S. Jain and S. Meeran, Deterministic Job-Shop Scheduling: Past, Present and Future, European Journal of Operational Research 113, 390-434, 1999.
13. Y. Kesten, A. Pnueli, J. Sifakis and S. Yovine, Decidable Integration Graphs, Information and Computation 150, 209-243, 1999.
14. J. McManis and P. Varaiya, Suspension Automata: A Decidable Class of Hybrid Automata. In D.L Dill (Ed.), Proc. CAV'94, 105-117, LNCS 818, Springer, 1994.
15. P. Niebert, S. Tripakis S. Yovine, Minimum-Time Reachability for Timed Automata, IEEE Mediteranean Control Conference, 2000.
16. P. Niebert and S. Yovine, Computing Efficient Operation Schemes for Chemical Plants in Multi-batch Mode, European Journal of Control 7, 440-453, 2001.
17. 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.
18. 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.