Dynamic backward scheduling method for max-plus linear systems with a repetitive, MIMO, FIFO structure

Authors:
Hiroyuki Goto;Shiro Masuda
Affiliations:
Department of Management and Information Systems Science, Nagaoka University of Technology, Nagaoka-shi, Niigata, Japan;Department of Management Systems Engineering, Tokyo Metropolitan University, Hino-shi, Tokyo, Japan
Venue:
WSEAS Transactions on Information Science and Applications
Year:
2008

Citing 5
Cited 1

TCP is max-plus linear and what it tells us on its throughput

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Brief paper: Input signal design for identification of max-plus-linear systems

Automatica (Journal of IFAC)
Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets

IEEE Transactions on Software Engineering
Optimal design of AQM controllers

SMO'07 Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization
Brief Model predictive control for max-plus-linear discrete event systems

Automatica (Journal of IFAC)

Resolution of resource conflict between the different two projects in MPL-CCPM representation

WSEAS Transactions on Information Science and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a dynamic scheduling method that considers no-concurrency of resource with a subsequent event. We focus on repetitive discrete event systems with a MIMO (Multiple Inputs and Multiple Outputs)-FIFO structure. The behavior of this kind of system can be described with linear equations in the max-plus algebra, also referred to as MPL (Max-Plus Linear). Conventional MPL representation formulates no-concurrency of resource with a previous event and can provide the earliest starting times in internal facilities. We recently proposed a calculation method for a single job; however, resource no-concurrency with a subsequent job is not considered. Thus, it may not give an optimal solution if a large number of jobs have to be considered simultaneously. Therefore, we derive a general form of the MPL representation that provides the latest start times considering no-concurrency with a subsequent event. We also consider an effective rescheduling method that is applicable in cases in which the system parameters are changed after the job has commenced.