Declarative Approach to Cyclic Scheduling of Multimodal Processes

Grzegorz Bocewicz , Zbigniew Banaszak


In this chapter, 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 deadlock-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, can be modeled in terms of Cyclic Concurrent Process Systems (CCPSs). The chapter suggests a novel approach for schedulability analysis employing the declarative modeling. In turn, the schedulability analysis for a given CCPS answers the question whether a cyclic schedule exists or not. A reference model of constraint satisfaction cyclic scheduling problem shows that unschedulability can be caused by a relation among an initial state and dispatching rules selected. The sufficient conditions guaranteeing CCPS schedulability are discussed and the recursive approach to their designing is proposed. Possible implementations are illustrated on example of the flexible manufacturing system operation.
Author Grzegorz Bocewicz
Grzegorz Bocewicz,,
, Zbigniew Banaszak (FoM / BITD)
Zbigniew Banaszak,,
- Business Information Technology Department
Publication size in sheets1.6
Book Golinska Paulina (eds.): EcoProduction and Logistics, EcoProduction, 2013, Springer Berlin Heidelberg, ISBN 978-3-642-23552-8, [978-3-642-23553-5], 326 p., DOI:10.1007/978-3-642-23553-5
Keywords in EnglishConstraint satisfaction problem, Cyclic behavior, cyclic scheduling, Declarative modeling, Environmental Engineering/Biotechnology, Environmental Management, Multimodal process, Production/Logistics/Supply Chain Management, Sustainable Development
Languageen angielski
Score (nominal)5
ScoreMinisterial score = 5.0, 23-02-2017, BookChapterNotSeriesMainLanguages
Citation count*10 (2016-05-25)
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?