• Journal of the Korean Mathematical Society
• /
• v.40 no.6
• /
• pp.943-950
• /
• 2003

The maximal column rank of an m by n matrix A over max algebra is the maximal number of the columns of A which are linearly independent. We compare the maximal column rank with rank of matrices over max algebra. We also characterize the linear operators which preserve the maximal column rank of matrices over max algebra.

• Industrial Engineering and Management Systems
• /
• v.3 no.1
• /
• pp.1-11
• /
• 2004

This paper proposes a new algorithm for determining an optimal control input for production systems. In many production systems, completion time should be planned within the due dates by taking into account precedence constraints and processing times. To solve this problem, the max-plus algebra is an effective approach. The max-plus algebra is an algebraic system in which the max operation is addition and the plus operation is multiplication, and similar operation rules to conventional algebra are followed. Utilizing the max-plus algebra, constraints of the system are expressed in an analogous way to the state-space description in modern control theory. Nevertheless, the formulation of a system is currently performed manually, which is very inefficient when applied to practical systems. Hence, in this paper, we propose a new algorithm for deriving a state-space description and determining an optimal control input with several constraint matrices and parameter vectors. Furthermore, the effectiveness of this proposed algorithm is verified through execution examples.

• Journal of the Korean Society for Railway
• /
• v.12 no.2
• /
• pp.267-275
• /
• 2009

Max-plus algebra is a nonlinear system comprised of two operations, maximization (max) and addition (Plus), which are corresponding to the addition and the multiplication in conventional algebra, respectively. This methodology is applicable to many discrete event systems containing the state transition with the maximization and addition operation. Timetable with connection is one of such systems. We present the method based on max-plus algebra, which can make up timetable considering transfer and analyse its stability and robustness. In this study, it will be shown how to make up the timetable of the urban train and analyse its stability using Max-Plus algebra.

• Honam Mathematical Journal
• /
• v.33 no.1
• /
• pp.93-113
• /
• 2011

Let $a{\oplus}b$ = max(a, b), $a{\otimes}b$=a+b, a, $b\in\mathbb{R}_{\varepsilon}\;:=\cup\{-\infty\}$. In max-plus algebra we work on the linear algebra structure for the pair of operations (${\oplus},{\otimes}$) extended to matrices and vectors over $\mathbb{R}_{\varepsilon}$. In this paper our main aim is to reproduce the work of R. A. Cuninghame-Green [3] on the linear systems over a max-plus semi-field $\mathbb{R}_{\varepsilon}$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.10
• /
• pp.1794-1800
• /
• 2008

This paper presents a method of constructing the digital logic switching functions using PLA. First of all, we propose a MIN and MAX algebra arithmetic operation based on the Post algebra. And we discuss the T-gate which is used for realization of the MIN and MAX algebra arithmetic operation. Next, we discuss the MIN array and MAX array which are basic circuit of the PLA, also we discuss the literal property. For the purpose of the design for the digital logic switching functions using PLA, we Propose the variable partition, modular structure design, literal generator, decoder and invertor. The proposed method is the more compactable and extensibility.

• Industrial Engineering and Management Systems
• /
• v.1 no.1
• /
• pp.1-9
• /
• 2002

Among the state-space description of discrete vent systems, the max-plus algebra is known as one of the effective approach. This paper proposes a model predictive control (MPC) design method based on the max-plus algebra. Several studies related to these topics have been done so far under the constraints that system parameters are constant. However, in practical systems such as production systems, it is common and sometimes inevitable that system parameters vary by each event. Therefore, it is of worth to design a new MPC controller taking account of adjustable system parameters. In this paper, we formulate system parameters as adjustable ones, and they are solved by a linear programing method. Since MPC determines optimal control input considering future reference signals, the controller can be more robust and the operation cost can be reduced. Finally, the proposed method is applied to a production system with three machines, and the effectiveness of the proposed method is verified through a numerical simulation.

• Communications of the Korean Mathematical Society
• /
• v.30 no.4
• /
• pp.385-402
• /
• 2015

In this paper we study the (good) semi-prime closure operations on ideals of a BCK-algebra, lower BCK-semilattice, Noetherian BCK-algebra and meet quotient ideal and then we give several theorems that make different (good) semi-prime closure operations. Moreover by given some examples we show that the given different notions are independent together, for instance there is a semi-prime closure operation, which is not a good semi-prime. Finally by given the notion of "$c_f$-Max X", we prove that every member of "$c_f$-Max X" is a prime ideal. Also we conclude some more related results.

• Korean Management Science Review
• /
• v.24 no.1
• /
• pp.25-34
• /
• 2007

In this study, we consider stationary waiting times in finite-buffer 3-node single-server queues in series with a Poisson arrival process and with either constant or non-overlapping service times. We assume that each node has a finite buffer except for the first node. The explicit expressions of waiting times in all areas of the stochastic system were driven as functions of finite buffer capacities. These explicit forms show that a system sojourn time does not depend on the finite buffer sizes, and also allow one to compute and compare characteristics of stationary waiting times at all areas under two blocking rules communication and manufacturing blocking. The goal of this study is to apply these results to an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on stationary waiting times at all nodes. Numerical examples are also provided.

• Industrial Engineering and Management Systems
• /
• v.7 no.1
• /
• pp.23-33
• /
• 2008

This paper proposes an approach to monitoring and scheduling methods for repetitive MIMO-FIFO DESs. We use max-plus algebra for modeling and formulation, known as an effective approach for controller design for this type of system. Because a certain type of linear equations in max-plus algebra can represent the system's behavior, the principal concerns in past researches were how to solve the equations. However, the researches focused mainly on analyses of the relation between inputs and outputs of the system, which implies that the changes or the slacks of internal states were not clarified well. We first examine several properties of the corresponding state variables, which contribute to finding and tracing the float times in each process. Moreover, we provide a rescheduling method that can take into account delays or changes of the internal states. These methods would be useful in schedule control or progress management.

• Journal for History of Mathematics
• /
• v.31 no.1
• /
• pp.1-17
• /
• 2018

In this expository paper, we present an abridged report on the max-plus eigenspaces of max-plus matrices with its brief history. At the end of our work, a number of examples are presented with maple codes, and then we make a claim from the observation of these examples, which is on the euclidean dimension of the max-plus eigenspaces of strongly definite matrices.