Efficient synthesis of production schedules by optimization of timed automata

Control Engineering Practice

Volumn 14, Issue 10, 2006, Pages 1183-1197

  Panek, Sebastian ^a   Stursberg, Olaf ^a   Engell, Sebastian ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Automata; Graph search; Linear programming; Model checking; Reachability; Scheduling; Timed systems

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; BENCHMARKING; INTEGER PROGRAMMING; OPTIMIZATION; SCHEDULING;

INDUSTRIAL SYSTEMS; MODEL CHECKING; REACHABILITY; TIMED SYSTEMS;

PRODUCTION CONTROL;

ALGORITHMS; AUTOMATA THEORY; BENCHMARKING; INTEGER PROGRAMMING; OPTIMIZATION; PRODUCTION CONTROL; SCHEDULING;

EID: 33744944065     PISSN: 09670661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.conengprac.2006.02.014     Document Type: Article

References (28)

1. Abdeddaim, Y. (2002). Scheduling with timed automata. Dissertation, VERIMAG, Institut National Polytechnique de Grenoble.
2. Abdeddaim, Y., & Maler, O. (2001). Job-shop scheduling using timed automata. In G. Berry, H. Comon (Eds.), Computer aided verification (CAV), Lecture notes in computer science (Vol. 2102) (pp. 478-492). Berlin: Springer.
3. Alur R., and Dill D.L. A theory of timed automata. Theoretical Computer Science 126 2 (1994) 183-235
4. Baptiste P., Le Pape C., and Nuijten W. Constraint-based scheduling: Applying constraint programming to scheduling problems (2001), Kluwer Academic Publishers, Dordrecht
5. Behrmann, G., Bouyer, P., Larsen, K. G., & Pelanek, R. (2004). Lower and upper bounds in zone based abstractions of timed automata. In Proceedings of the TACAS'04. Lecture notes in computer science (Vol. 2988) (pp. 312-326).
6. Behrmann, G., Fehnker, A., Hune, T. S., Petterson, P., Larsen, K., & Romijn, J. (2001). Efficient guiding towards cost-optimality in UPPAAL. In Proceedings of the TACAS'01 (pp. 174-188).
7. Behrmann, G., Larsen, K. G., Pearson, J., Weise, C., & Yi, W. (1999). Efficient timed reachability analysis using clock difference diagrams. In Computer aided verification (pp. 341-353).
8. Brooke A., Kendrick D., Meeraus A., and Raman R. GAMS-A user's guide (1998), GAMS Development Corp., Washington
9. Bruns, R. (1997). Scheduling. In T. Baeck, D. B. Fogel, & Z. Michalewicz (Eds.), Handbook of evolutionary computation (pp. F1.5:1-9). Inst. of Physics Publ.
10. Cerda J., Henning G.P., and Grossmann I.E. A mixed-integer linear programming model for short-term scheduling of single-stage multiproduct batch plants with parallel lines. Industrial Chemistry and Engineering Research 36 (1997) 1695-1707
11. Fehnker, A. (2002). Citius, vilius, melius-guiding and cost-optimality in model checking of timed and hybrid systems. Dissertation, KU Nijmegen.
12. Floudas C.A., and Lin X. Continuous-time versus discrete-time approaches for scheduling of chemical processes: A review. Computers and Chemical Engineering 28 (2004) 2109-2129
13. Godefroid, P. (1991). Using partial orders to improve automatic verification methods. In Proceedings of the second workshop on computer aided verification. Lecture notes in computer science (Vol. 531) (pp. 176-185). Berlin: Springer.
14. Godefroid, P. (1994). Partial-order methods for the verification of concurrent systems-an approach to the state-explosion problem. Dissertation, University of Liege, Computer Science Department.
15. Groetschel, M., Krumke, S. O., & Rambau, R. (Eds.). (2001). Online optimization of large scale systems. Berlin: Springer.
16. Ierapetritou M., and Floudas C. Effective continuous-time formulation for short-term scheduling-multipurpose batch processes. Industrial & Engineering Chemistry Research 37 (1998) 4341-4359
17. Jain A.S., and Meeran S. Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research 113 (1999) 390-434
18. Kallrath J. Combined strategic and operational planning-An MILP success story in chemical industry. Operation Research Spectrum 24 (2002) 315-341
19. Kondili E., Pantelides C.C., and Sargent R.W.H. A general algorithm for short-term schedule of batch operations-MILP formulation. Computers and Chemical Engineering 17 (1993) 211-227
20. Larsen, K., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., & Romijn, J. (2001). As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In Computer aided verification (CAV). Lecture notes in computer science (Vol. 2102) (pp. 493-505). Berlin: Springer.
21. Larsen K.G., Petterson P., and Yi W. Uppaal in a nutshell. International Journal of Software Tools for Technical Transfer 1 1 (1997) 134-152
22. Manne A.S. On the job-shop scheduling problem. Operation Research 8 2 (1960) 219-223
23. Mendez C.A., Henning G.P., and Cerda J. An milp continuous-time approach to short-term scheduling of resource-constrained multistage flowshop btach facilities. Computers and Chemical Engineering 25 (2001) 701-711
24. Mounier, L., Graf, S., & Bozga, M. (2002). If-2.0: A validation environment for component-based real-time systems. In Proceedings of the CAV'02. Lecture notes in computer science (Vol. 2404) (pp. 343-348). Berlin: Springer.
25. Panek, S., Stursberg, O., & Engell, S. (2004a). Job shop scheduling by combining reachability analysis with linear programming. In Proc. IFAC workshop on discrete event systems. (pp. 199-204).
26. Panek, S., Stursberg, O., & Engell, S. (2004b). Optimisation of timed automata models using mixed-integer programming. In Formal mod. and analysis of timed systems. Lecture notes in computer science (Vol. 2791) (pp. 73-87). Berlin: Springer.
27. Shah N., Pantelides C.C., and Sargent R.W.H. A general algorithm for short-term scheduling of batch operations-ii. Computational issues i. MILP formulation. Computers and Chemical Engineering 17 2 (1993) 229-244
28. Yovine, S., 1998. Model checking timed automata. In Embedded systems. Lecture notes in computer science (Vol. 1494) (pp. 114-152). Berlin: Springer.