Scheduling Based on Reachability Analysis of Timed Automata

Panek, Sebastian; Stursberg, Olaf; Engell, Sebastian

doi:10.1002/9783527622771.ch10

Cited by 1 publication

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The sets of TA models created are then passed to the solution technique module of TAOpt to create the composed automaton and to search the resulting graph for traces that correspond to valid schedules. For problems with material balances, e.g., the benchmark problem proposed by Westenberger and Kallrath in ref , where an operation consumes only a fraction of a material and produces only a fraction of new material and the same operation can be performed more than one time, the parallel composition is done on the fly only on the sets of resource automata to form the global automaton . In this case, the TA models of the recipes were not created, as the precedence relation between the operations of the recipes was encoded in shared variables of the resource automata .…”

Section: Timed Automata Optimizer - Taoptmentioning

confidence: 99%

“…For problems with material balances, e.g., the benchmark problem proposed by Westenberger and Kallrath in ref , where an operation consumes only a fraction of a material and produces only a fraction of new material and the same operation can be performed more than one time, the parallel composition is done on the fly only on the sets of resource automata to form the global automaton . In this case, the TA models of the recipes were not created, as the precedence relation between the operations of the recipes was encoded in shared variables of the resource automata . For problems without material balances where an operation consumes the entire material and produces the entire new material and where each operation is performed only once, e.g., for job shop scheduling, the TA models of the recipes are created to take care of the precedence relation, and the parallel composition is done on the fly on sets of resource and recipe automata.…”

Section: Timed Automata Optimizer - Taoptmentioning

confidence: 99%

See 1 more Smart Citation

An Intuitive and Efficient Approach to Process Scheduling with Sequence-Dependent Changeovers Using Timed Automata Models

Subbiah

Schoppmeyer

Engell

2011

Ind. Eng. Chem. Res.

Self Cite

View full text Add to dashboard Cite

In the process industries where multiple products have to be produced in the batch mode, the optimal assignment of the operations to the available resources and their sequencing can contribute considerably to economic success. Among the several methods proposed to model and solve batch scheduling problems, techniques based on a reachability analysis of timed automata (TA) models have gained attention recently. The appeal of the approach is the modular, intuitive, and straightforward graphical modeling of complex scheduling problems, and an efficient solution technique based upon reachability algorithms. In this contribution, we present an introduction to the TA-based approach to scheduling and specifically address the problem of batch scheduling with sequence-dependent setup and changeover times. In the TA-based approach, the resources, recipes, and additional timing constraints are modeled independently as sets of (priced) timed automata. The sets of individual automata are synchronized by means of synchronization labels and are composed by parallel composition to form a global automaton. A cost-optimal symbolic reachability analysis is performed on the composed automaton to derive schedules with the objective of minimizing makespan. The TA models of the recipes are extended here to include setup times as well as sequence-dependent changeovers. The performance of the approach to model and to solve real-world scheduling problems with sequence-dependent changeovers is demonstrated for two different case studies. A comparative study on the TA-based approach with various MILP formulations is performed on a famous case study from the literature, and the results are discussed.

show abstract

Section: Timed Automata Optimizer - Taoptmentioning

confidence: 99%

Section: Timed Automata Optimizer - Taoptmentioning

confidence: 99%