Toward Cyclic Scheduling of Concurrent Multimodal Processes
Grzegorz Bocewicz , Robert Wójcik , Zbigniew Banaszak
AbstractThe problem of cyclic scheduling of multimodal cyclic processes (MCPs) is considered. The issue follows the production engineering and supply chains environment, where the imposition of the integer domain results (due to inherent process features such as discrete slot sizes, etc.) in the Diophantine character of a scheduling problem. Consequently, some classes of MCPs scheduling problems can be regarded as non-decidable ones. Since system constraints its behavior, both system structure configuration and desired schedule have to be considered simultaneously. Therefore, MCP scheduling problem solution requires that the system structure configuration must be determined for the purpose of processes scheduling, yet scheduling must be done to devise the system configuration. The approach proposed in this paper provides the framework allowing one to take into account both direct and reverse formulation of the cyclic scheduling problem. It permits to determine the model for the assessment of the impact of the structure of local cyclic processes on the parameters of global MCP. Discussion of some solubility issues concerning multimodal cyclic process dispatching problems is provided.
|Book||Jedrzejowicz Piotr, Nguyen Ngoc Thanh, Hoang Kiem (eds.): Computational Collective Intelligence. Technologies and Applications, Lecture Notes In Computer Science, no. 6922, 2011, Springer Berlin Heidelberg, ISBN 978-3-642-23934-2, 978-3-642-23935-9|
|Keywords in English||Algorithm Analysis and Problem Complexity, Artificial Intelligence (incl. Robotics), Computer Communication Networks, concurrent processes, cyclic processes, Data Mining and Knowledge Discovery, Diophantine problem, Information Systems Applications (incl. Internet), multimodal processes, scheduling, state space, User Interfaces and Human Computer Interaction|
|Citation count*||3 (2016-05-25)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.