Declarative approach to cyclic steady state space refinement: periodic process scheduling

Abstract

Problems of cyclic scheduling are usually observed in flexible manufacturing systems which produce multitype parts where the automated guided vehicle system plays the role of a material handling system, as well as in various other multimodal transportation systems where goods and/or passenger itinerary planning plays a pivotal role. The schedulability analysis of the processes executed in the so-called systems of concurrent cyclic processes (SCCPs) can be executed within a declarative modeling framework. Consequently, the considered SCCP scheduling problem can be seen as a constraint satisfaction problem. Such a representation provides a unified way for evaluating the performance of local cyclic processes as well as of multimodal processes supported by them. Here, the crucial issue is that of a control procedure (e.g., a set of dispatching rules), which would guarantee the cyclic behavior of the SCCP. In this context, we discuss the sufficient conditions guaranteeing the schedulability of both local and multimodal cyclic processes, and we propose a recursive approach in designing them.

Multimodal processes prototyping subject to grid-like network and fuzzy operation time constraints

“…Consequently, the problem considered in this research can be seen as an extension and/or refining of the problems formulated in our former works (Bocewicz and Banaszak 2013;Bocewicz et al 2014aBocewicz et al , b, 2015Bocewicz et al , 2016Nielsen et al 2016) focused on a solution to a constraint satisfaction problem aimed at AGVs fleet match-up scheduling while taking into account fuzzy operation times constraints. In order to delimit the work addressed in this research we will first present contributions concerning some of the main issues.…”

“…In order to delimit the work addressed in this research we will first present contributions concerning some of the main issues. The schedulability analysis of the processes executed in the so-called systems of concurrent cyclic processes executed within a declarative modeling framework is provided in Bocewicz and Banaszak (2013). The considered representation provides a unified way for evaluating the performance of local cyclic processes as well as of the multimodal processes supported by these.…”

“…Processes interact with each other via common used resources in the form of either transportation or processing operations. Dispatching rules allotted to common shared resources provide a mutual exclusion protocol synchronizing processes interaction (Bocewicz and Banaszak 2013).…”

Traffic flow routing and scheduling in a food supply network

“…A SCCP (see Figure 1) (Bocewicz and Banaszak, 2013) consists of a set of local processes P ¼ {P i |i ¼ 1 … ln} which execute operations periodically, based on a set of shared resources R ¼ {R k |k ¼ 1 … lk}. Each process P i is characterised by a sequence of operations…”

“…Assuming a supply system has a structure and behaviour (Bocewicz and Banaszak, 2013), one can distinguish elements of the structure of such a system (including transport roads, goods transfer facilities, etc.) and processes which determine its behaviour (e.g.…”