SCHEDULING OF MULTI-PRODUCT BATCH PLANTS USING REACHABILITY ANALYSIS OF TIMED AUTOMATA MODELS

Subanatarajan Subbiah, Sebastian Panek, Sebastian Engell, Olaf Stursberg

2007

Abstract

Standard scheduling approaches in process industries are often based on algebraic problem formulations solved as MI(N)LP optimization problems to derive production schedules. To handle such problems techniques based on timed automata have emerged recently. This contribution reports on a successful application of a new modeling scheme to formulate scheduling problems in process industries as timed automata (TA) models and describes the solution technique to obtain schedules using symbolic reachability analysis. First, the jobs, resources and additional constraints are modeled as sets of synchronized timed automata. Then, the individual automata are composed by parallel composition to form a global automaton which has an initial location where no jobs have been started and at least one target location where all jobs have been finished. A cost optimal symbolic reachability analysis is performed on the composed automaton to derive schedules. The main advantage of this approach over other MILP techniques is the intuitive graphical and modular modeling and the ability to compute better solutions within reasonable computation time. This is illustrated by a case study.

References

  1. Abdeddaim, Y. and Maler, O. (2001). Job-shop scheduling using timed automata. Computer Aided Verification (CAV), Springer, pages 478-492.
  2. Alur, R. and Dill, D. (1994). A theory of timed automata. Theor. Comp.Science, 126(2):183-235.
  3. Barthomieu, B. and Diaz, M. (1991). Modeling and verification of time dependent systems using timed petri nets. IEEE Transactions Software Engineering, 126(2):259-273.
  4. Bauer, N., Kowalewski, S., Sand, G., and Loehl, T. (2000). A case study: Multi product batch plant for the demonstration of scheduling and control problems. In ADPM2000 Conference Proceedings-Hybrid Dynamic Systems, pages 383-388. Shaker.
  5. Behrmann, G., Fehnker, A., Hune, T., Peterson, P., Larsen, K., and Romjin, K. (2001). Efficient guiding towards cost-optimality in UPPAAL. In Proceedings TACAS'01, pages 174-188.
  6. Godefroid, P. (1991). Using partial orders to improve automatic verification methods. In Proc. 2nd Workshop on Computer Aided Verification, 531 of LNCS:176-185.
  7. Kallrath, J. (2002). Planning and scheduling in the process industry. OR Spectrum, 24:219-250.
  8. Panek, S., Engell, S., and Lessner, C. (2005). Scheduling of a pipeless multi-product batch plant using mixedinteger programming combined with heuristics. In European Symposium on Computer Aided Process Engineering, ESCAPE 15, pages 1033-1038.
  9. Panek, S., Engell, S., and Stursberg, O. (2006). Efficient synthesis of production schedules by optimization of timed automata. Control Engineering Practice, pages 149-156.
  10. Panek, S., Engell, S., Subbiah, S., and Stursberg, O. (2007). Scheduling of multi-product batch plants based upon timed automata models. Submitted to Comp. Chem. Eng.
  11. Pantelides, C. (1994). Unified frameworks for optimal process planning and scheduling. In Proceedings 2nd conference Foundations of Computer Aided Process Operations, pages 253-274.
Download


Paper Citation


in Harvard Style

Subbiah S., Panek S., Engell S. and Stursberg O. (2007). SCHEDULING OF MULTI-PRODUCT BATCH PLANTS USING REACHABILITY ANALYSIS OF TIMED AUTOMATA MODELS . In Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-972-8865-82-5, pages 141-148. DOI: 10.5220/0001627501410148


in Bibtex Style

@conference{icinco07,
author={Subanatarajan Subbiah and Sebastian Panek and Sebastian Engell and Olaf Stursberg},
title={SCHEDULING OF MULTI-PRODUCT BATCH PLANTS USING REACHABILITY ANALYSIS OF TIMED AUTOMATA MODELS},
booktitle={Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2007},
pages={141-148},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001627501410148},
isbn={978-972-8865-82-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - SCHEDULING OF MULTI-PRODUCT BATCH PLANTS USING REACHABILITY ANALYSIS OF TIMED AUTOMATA MODELS
SN - 978-972-8865-82-5
AU - Subbiah S.
AU - Panek S.
AU - Engell S.
AU - Stursberg O.
PY - 2007
SP - 141
EP - 148
DO - 10.5220/0001627501410148