Production scheduling by reachability analysis: a case study


Behrmann, Gerd and Brinksma, Ed and Hendriks, Martijn and Mader, Angelika (2005) Production scheduling by reachability analysis: a case study. In: 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005, 4-8 April 2005, Denver, CO, USA (pp. p. 140).

[img] PDF - Published Version
Restricted to UT campus only
: Request a copy
Abstract:Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness of timed automata allows – unlike many classical approaches – the modelling of scheduling problems of very different kinds. Furthermore, the models are robust against changes in the parameter setting and against changes in the problem specification. This paper presents a case study that was provided by Axxom, an industrial partner of the AMETIST project. It consists of a scheduling problem for lacquer production, and is treated with the timed automata approach. A number of problems have to be addressed for the modelling task: the information transfer from the industrial partner, the derivation of timed automaton model for the case study, and the heuristics that have to be added in order to reduce the search space. We try to isolate the generic problems of modelling for model checking, and suggest solutions that are also applicable for other scheduling cases. Model checking experiments and solutions are discussed.
Item Type:Conference or Workshop Item
Copyright:© 2005 IEEE
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 228770