Synthesis and stochastic assessment of cost-optimal schedules

Abstract

We present a novel approach to synthesize good schedules for a class of scheduling problems that is slightly more general than the scheduling problem F Jm, a|gpr, r j , d j |early/tardy. The idea is to prime the schedule synthesizer with stochastic information more meaningful than performance factors with the objective to minimize the expected cost caused by storage or delay. The priming information is obtained by stochastic simulation of the system environment. The generated schedules are assessed again by simulation. The approach is demonstrated by means of a non-trivial scheduling problem from lacquer production. The experimental results show that our approach achieves in all considered scenarios better results than the extended processing times approach.

Fortuna: Model Checking Priced Probabilistic Timed Automata

“…We do not compare on memory use as these statistics from the other approaches are unavailable to us. However, for the instance of the case study that is the largest in both A production plant: This case study has been inspired by a case study on a lacquer production plant [20]. Although small, it easily scales up to more elaborate plant models.…”

mctau: Bridging the Gap between Modest and UPPAAL

“…Modest has been used in a wide variety of application studies, ranging from wireless sensor networks [2,17] to architectural dependability models [4] and industrial production scheduling [14]. The principle idea behind the formalism and its supporting tools is to provide a single-formalism, multi-solution approach to modelling and analysis, using existing analysis engines and algorithms where available to avoid unnecessary reimplementations.…”