• Journal of the Korea Society for Simulation
• /
• v.21 no.4
• /
• pp.11-24
• /
• 2012

We compared a DBR(drum-buffer-rope) system with a CONWIP(constant work-in-process) system in a production line with constant processing times. Based on the observation that a WIP-controlled line production system such as DBR and CONWIP 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 also used to demonstrate the proposed analysis. The mathematical analyses support that CONWIP outperforms DBR in terms of expected waiting time and WIP. Unlike the CONWIP case, sequencing workstations in a DBR affects the performance of the system. Delaying a bottleneck station in a DBR reduces expected waiting time.

• 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 Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.57-61
• /
• 2013

A hybrid genetic algorithm based learning method for the morphological neural networks (MNN) is proposed. The morphological neural networks are based on max-plus algebra, therefore, it is difficult to optimize the coefficients of MNN by the learning method with derivative operations. In order to solve the difficulty, a hybrid genetic algorithm based learning method to optimize the coefficients of MNN is used. Through the image compression/reconstruction experiment using test images extracted from standard image database(SIDBA), it is confirmed that the quality of the reconstructed images obtained by the proposed method is better than that obtained by the conventional neural networks.

• ETRI Journal
• /
• v.36 no.4
• /
• pp.609-616
• /
• 2014

Even though many computational methods (recursive formulae) for blocking probabilities in finite-capacity M/D/1 queues have already been produced, these are forms of transforms or are limited to single-node queues. Using a distinctly different approach from the usual queueing theory, this study introduces explicit (transform-free) formulae for a blocking probability, a stationary probability, and mean sojourn time under either production or communication blocking policy. Additionally, the smallest buffer capacity subject to a given blocking probability can be determined numerically from these formulae. With proper selection of the overall offered load ${\rho}$, the approach described herein can be applicable to more general queues from a computational point of view if the explicit expressions of random vector $D_n$ are available.