Transferring progress control policies in scheduling problems for a class of repetitive discrete event systems

Abstract

This research implements a method, based on Dioid algebra, of transferring progress control policies for a class of repetitive discrete event systems. Commonly used policies include one that requires precedence constraints with respect to processing order relations, and another in which relative processing start and completion times for all facilities are specified. In conventional methods, however, the framework for handling the state equation differs, depending on which policy is used. These policies are thus distinct, and cannot as yet be treated in a unified manner. This research proposes a method of transferring the transition matrices by using common parameter matrices and vectors, and implements a method of transferring the progress control policy per job.

Keywords:

• Dioid algebra
• state-space representation
• adjacency matrix
• heap model
• directed acyclic graph
• progress control

Acknowledgements

H. Goto was supported by research grants from Takahashi Industrial and Economic Research Foundation, The Mazda Foundation and the JSPS Grants-in-Aid for Scientific Research No. 20710114. H. Takahashi was partially supported by the Uchida Energy Science Promotion Foundation, Sasagawa Scientific Research Grand and the JSPS Grant-in-Aid for Scientific Research No. 20540260.