• Communications of the Korean Mathematical Society
• /
• v.13 no.2
• /
• pp.225-232
• /
• 1998

Let H be a finite dimensional Hopf algebra over a field k, and A be an H-module algebra over k which the H-action on A is D-continuous. We show that $Q_{max}(A)$, the maximal ring or quotients of A, is an H-module algebra. This is used to prove that if H is a finite dimensional semisimple Hopf algebra and A is a semiprime right(left) Goldie algebra than $A#H$ is a semiprime right(left) Goldie algebra. Assume that Asi a semiprime H-module algebra Then $A^H$ is left Artinian if and only if A is left Artinian.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.241-247
• /
• 2008

In this study we consider an M/D/1 queue with a finite buffer. Due to the finiteness of the buffer capacity arriving customers can not join the system and turn away without service when the buffer is full. Even though a computational method for blocking probabilities in an M/D/1/K queue is already known, it is very complex to use. The aim of this study is to propose a new way to compute blocking probability by using (max,+)-algebra. Our approach provide a totally different and easier way to compute blocking probabilities and it is, moreover, immediately applicable to more generous queueing systems.

• Journal of the Korea Society for Simulation
• /
• v.24 no.2
• /
• pp.11-17
• /
• 2015

Although systems with finite capacities have been the topic of much study, there are as of yet no analytic expressions for (higher) moment and tail probability of stationary waiting times in systems with even constant processing times. The normal queueing theory cannot properly handle such systems due to the difficulties caused by finite capacity. In this study, for a DBR (Drum-Buffer-Rope) line production system with constant processing times, we introduce analytic expressions by using previous results obtained using a max-plus algebraic approach.

• Journal of the Korea Society for Simulation
• /
• v.28 no.2
• /
• pp.119-129
• /
• 2019

Although line production systems with finite buffers have been studied over several decades, except for some special cases there are no explicit expressions for system performances such as waiting times(or response time) and blocking probability. Recently, a max-plus algebraic approach for buffer-sharing systems with constant processing times was introduced and it can lead to analytic expressions for (higher) moment and tail probability of stationary waiting. Theoretically this approach can be applied to general processing times, but it cannot give a proper way for computing performance measures. To this end, in this study we developed simulation models using @RISK software and the expressions derived from max-plus algebra, and computed and compared blocking probability, waiting time (or response time) with respect to two blocking policies: communication(BBS: Blocking Before Service) and production(BAS: Blocking After Service). Moreover, an optimization problem which determines the minimum shared-buffer capacity satisfying a predetermined QoS(quality of service) is also considered.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.161-164
• /
• 2000

A cyclic shop is a production system that repeatedly produces identical sets of jobs, called minimal part sets, in the same loading and processing sequence. We consider a version of cyclic shop where the operations are processed and unloaded within time limits, so called a time window. We model the shop using an event graph model, a class of Petri nets. To represent the time window constraint, we introduce places with negative time delays. From the shop modeling graph, we develop a linear system model based on the max- plus algebra and characterize the conditions on the existence of a stable schedule.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.36 no.2
• /
• pp.51-65
• /
• 2011

We compared a CONWIP(constant work-in-process) system with a kanban system in a production line with constant processing times. Based on the observation that a WIP-controlled line production system such as CONWIP and kanban is equivalent to a m-node tandem queue with finite buffer, we applied a max-plus algebra based solution method for the tandem queue to evaluate the performance of two systems. Numerical examples with 6 workstations were used to demonstrate the proposed analysis. The numerical results support the previous studies that CONWIP outperforms kanban in terms of expected waiting time and WIP. Unlike the kanban case, sequencing workstations in a CONWIP does not affect the performance of the system.

• Journal of the Korea Society for Simulation
• /
• v.28 no.3
• /
• pp.65-74
• /
• 2019

For many years, it has been widely studied on fork-join production systems but there is not much literature focusing on the finite buffer(s) of either individuals or shared, and generally distributed processing times. Usually, it is difficult to handle finite buffer(s) through a standard queueing theoretical approach. In this study, by using the max-plus algebraic approach we studied buffer-shared fork-join production systems with general processing times. However, because it cannot provide proper computational ways for performance measures, we developed simulation models using @RISK software and the expressions derived from max-plus algebra. From the simulation experiments, we compared some properties on waiting time with respect to a buffer capacity under two blocking policies: BBS (Blocking Before Service) and BAS (Blocking After Service).

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.294-294
• /
• 1999

• Honam Mathematical Journal
• /
• v.36 no.3
• /
• pp.623-635
• /
• 2014

Classications of (${\alpha},{\beta}$)-fuzzy subalgebras of BCK/BCI-algebras are discussed. Relations between (${\in},{\in}{\vee}q$)-fuzzy subalgebras and ($q,{\in}{\vee}q$)-fuzzy subalgebras are established. Given special sets, so called t-q-set and t-${\in}{\vee}q$-set, conditions for the t-q-set and t-${\in}{\vee}q$-set to be subalgebras are considered. The notions of $({\in},q)^{max}$-fuzzy subalgebra, $(q,{\in})^{max}$-fuzzy subalgebra and $(q,{\in}{\vee}q)^{max}$-fuzzy subalgebra are introduced. Conditions for a fuzzy set to be an $({\in},q)^{max}$-fuzzy subalgebra, a $(q,{\in})^{max}$-fuzzy subalgebra and a $(q,{\in}{\vee}q)^{max}$-fuzzy subalgebra are considered.

• Industrial Engineering and Management Systems
• /
• v.8 no.3
• /
• pp.155-161
• /
• 2009

We focus on discrete event systems with a structure of parallel processing, synchronization, and no-concurrency. We use max-plus algebra, which is an effective approach for controller design for this type of system, for modeling and formulation. Since a typical feature of this type of system is that the initial schedule is frequently changed due to unpredictable disturbances, we use a simple model and numerical examples to examine the possibility of applying the concepts of the feeding buffer and the project buffer of critical chain project management (CCPM) on max-plus linear discrete event systems in order to control the occurrence of an undesirable state change. The application of a CCPM-based framework on a max-plus linear discrete event system was proven to be effective.