Name
Abstract | ||
|---|---|---|
In this paper, we deal with the cyclic scheduling problem usually observed in the FMS producing multi-type parts where the AGVS plays a role of a material handling system. Finding the conditions guaranteeing the AGVs dead-lock-free and collision-free movement policy is the aim of this work. The AGVs co-sharing the common parts of the transportation route while executing repetitive processes, i.e. being assigned to AGVs passing along machines in a cyclic way, can be modeled in terms of Cyclic Concurrent Process Systems (CCPS). Schedulability analysis for a given CCPS answers the question whether a cyclic schedule exists or not. The paper suggests a novel approach for schedulability analysis employing the declarative modeling. The sufficient conditions guaranteeing CCPS schedulability are discussed and the recursive approach to their designing is proposed. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.3233/978-1-61499-105-2-1942 | ADVANCES IN KNOWLEDGE-BASED AND INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS |
Keywords | Field | DocType |
Cyclic behavior,cyclic scheduling,constraint satisfaction problem,declarative modeling | Computer science,Cyclic scheduling,Distributed computing | Conference |
Volume | ISSN | Citations |
243 | 0922-6389 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Grzegorz Bocewicz | 1 | 88 | 27.64 |
| Zbigniew A. Banaszak | 2 | 12 | 5.14 |
| Pawel Pawlewski | 3 | 67 | 21.03 |