• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1124-1132
• /
• 2006

This paper considers a flow shop scheduling problem where a different WIP (work-in-process) state has different weight on the duration time. The objective is to minimize the sum of the weighted WIP. For the two machine flow shop case, the recognition version is unary NP-Complete. The three simple and intuitive heuristics H0, H1, and H2 are presented for the problem. For each heuristic, we find an upper bound on relative error which is tight in limit. For heuristic H2, we show that H2 dominates the other two heuristics.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.3
• /
• pp.13-19
• /
• 1999

In this paper, we suggests a WIP (Work In Process) of FMC (Flexible Manufacturing Cell) analysis methods based on the TPN (Time Petri Nets) unfolding. Unfolding of PN is a partial order-based method for the verification of concurrent system without the state space explosion. The aim of this work is to formulate the general cyclic state scheduling problem to minimize the WIP to satisfy economical constraints. The method is based on unfolding of the original net into the equivalent acyclic description.

• Bulletin of the Korean Chemical Society
• /
• v.29 no.8
• /
• pp.1575-1578
• /
• 2008

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.1
• /
• pp.55-63
• /
• 2019

This paper develops an algorithm to determine the batch size of the batch process in real time for improving production and efficient control of production system with multiple processes and batch processes. It is so important to find the batch size of the batch process, because the variability arising from the batch process in the production system affects the capacity of the production. Specifically, batch size could change system efficiency such as throughput, WIP (Work In Process) in production system, batch formation time and so on. In order to improve the system variability and productivity, real time batch size determined by considering the preparation time and batch formation time according to the number of operation of the batch process. The purpose of the study is to control the WIP by applying CONWIP production system method in the production line and implements an algorithm for a real time batch size decision in a batch process that requires long work preparation time and affects system efficiency. In order to verify the efficiency of the developed algorithm that determine the batch size in a real time, an existed production system with fixed the batch size will be implemented first and determines that batch size in real time considering WIP in queue and average lead time in the current system. To comparing the efficiency of a system with a fixed batch size and a system that determines a batch size in real time, the results are analyzed using three evaluation indexes of lead time, throughput, and average WIP of the queue.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.3
• /
• pp.275-286
• /
• 2015

In this paper, we propose a practical method for setting up a daily production plan which can operate semiconductor fabrication factories more stably and linearly by determining work in process (WIP) targets and movement targets. We first adjust cycle times of the operations to satisfy the monthly production plan. Second, work in process (WIP) targets are determined to control the production progress of operations: earliness and tardiness. Third, movement targets are determined to reduce cumulated differences between WIP targets and actual WIPs. Finally, the determined movement targets are modified through a simulation model which considers capacities of the equipments and allocations of the WIPs in the fab. The proposed daily production planning method can be easily adapted to the memory semiconductor fabs because the method is very simple and has straightforward logics. Although the proposed method is simple and straightforward, the power of the method is very strong. Results from the shop floor in past few periods showed that the proposed methodology gives a good performance with respect to the productivity, workload balance, and machine utilization. We can expect that the proposed daily production planning method will be used as a useful tool for operating semiconductor fabrication factories more efficiently and effectively.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.3
• /
• pp.283-289
• /
• 2011

In this research a controller based on velocity estimator for a Wheeled Inverted Pendulum (WIP) is designed and various numerical simulation studies are carried out. The WIP has stable and unstable equivalent points. To Keep the unstable equilibrium point, a controller should control carefully the wheels persistently. There are angle, angular velocity, displacement, and velocity of the WIP for controller inputs. The velocity is obtained by differentiating the encoder signals from the motor and is subject to the resolution of the encoder. An improved velocity detection method is proposed based on low resolution encoder and velocity estimator. Various numerical simulations are carried out for showing the validation of the velocity estimator in case of the inclined road condition.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.18 no.6
• /
• pp.15-22
• /
• 2000

• IE interfaces
• /
• v.15 no.4
• /
• pp.349-355
• /
• 2002

In order to build a new factory, we must have answers regarding the following questions; 1. what is to be produced? 2. how are the products to be produced? 3. how much of each product will be produced? The answers are related to product-design, process-design and capacity-design respectively and they are used for layout-design as the input data. Especially capacity design decision provides the information regarding the number of equipments required and the balance of the line. This paper introduces a case study on the capacity design for a new factory where the retainers of ball bearing are manufactured. A simulation model is developed with ARENA for analyzing the system considered. The major objectives of the study are evaluating the performance of the line which is originally suggested by the company, and finding out alternatives for improving the system. Number of WIP between the processes are also investigated because it affects the space planning of the layout.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1250-1255
• /
• 1990

This paper discusses an optimal cyclic scheduling problem for a FMC (Flexible Manufacturing Cell) modeled by a two-machine flowshop with two machining centers with APC's (Automated Pallet Changers), an AGV (Automated Guided Vehicle) and loading and unloading stations. Cyclic production in which similar patterns of production is repeated can significantly reduce the production lead-time and WIP (Work-In-Process) in such flexible, automated system. Thus we want to find an optimal cyclic schedule that minimizes the cycle time in each cycle. However, the existence of APC's as buffer storage for WIP makes the problem intractable (i.e., NP-complete). We propose an practical approximation algorithm that minimizes, instead of each cycle time, its upper bound. Performances of this algorithm are validated by the way of computer simulations.