Author:
Behrmann Gerd,Fehnker Ansgar,Hune Thomas,Larsen Kim,Pettersson Paul,Romijn Judi
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. D. Applegate and W. Cook. A Computational Study of the Job-Shop Scheduling Problem. OSRA Journal on Computing 3, pages 149–156, 1991.
2. Lect Notes Comput Sci;M. Bozga,1998
3. G. Behrmann, A. Fehnker, T. Hune, K. G. Larsen, P. Pettersson, J. Romijn, and F. Vaandrager. Minimum-Cost Reachability for Priced Timed Automata. Accepted for Hybrid Systems: Computation and Control, 2001.
4. P. Brucker, B. Jurisch, and B. Sievers. Code of a Branch & Bound Algorithm for the Job Shop Problem. Available at url http://www.mathematik.uni-osnabrueck.de/research/OR/ ,1995.
5. R. Boel and G. Stremersch. Report for VHS: Timed Petri Net Model of Steel Plant at SIDMAR. Technical report, SYSTeMS Group, University Ghent, 1999.
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parameterized Verification of Disjunctive Timed Networks;Lecture Notes in Computer Science;2023-12-30
2. Monte Carlo Tree Search for Priced Timed Automata;Quantitative Evaluation of Systems;2022
3. Verification and abstraction of real-time variability-intensive systems;International Journal on Software Tools for Technology Transfer;2019-09-21
4. Minimal-Time Synthesis for Parametric Timed Automata;Tools and Algorithms for the Construction and Analysis of Systems;2019
5. Probabilistic Model Checking: Advances and Applications;Formal System Verification;2017-06-22