• IE interfaces
• /
• v.25 no.1
• /
• pp.106-113
• /
• 2012

There are few factors like a due date observance of the customer's order, reducing the manufacturing lead time, and minimizing the inventory investment to successfully run the manufacturing system. It is difficult for corporation and a person concerned to be offered indicators to achieve few factors mentioned above from complex manufacturing systems having much fluctuations. Simplified-DBR based on TOC(Theory of Constraints) is a management paradigm which can offer indicators to effectively face with fluctuating market's needs when market's demand is smaller than a capacity of manufacturing system. This paper is offering a core indicator and management model which is needed to successfully run the manufacturing system for corporation and a person concerned who have short experience and knowledge and newly construct Sinplified-DBR manufacturing system. Thus, this paper provides a systemic guidance in the offered model through the simulation.

• ETRI Journal
• /
• v.37 no.1
• /
• pp.197-202
• /
• 2015

A smart grid is a modernized electrical grid that uses information about the behaviors of suppliers and consumers in an automated fashion to improve the efficiency, reliability, economics, and sustainability of the production and distribution of electricity. In the operation of a smart grid, demand side management (DSM) plays an important role in allowing customers to make informed decisions regarding their energy consumption. In addition, it helps energy providers reduce peak load demand and reshapes the load profile. In this paper, we propose a new DSM scheduling scheme that makes use of the day-ahead pricing strategy. Based on the Rubinstein-Stahl bargaining model, our pricing strategy allows consumers to make informed decisions regarding their power consumption, while reducing the peak-to-average ratio. With a simulation study, it is demonstrated that the proposed scheme can increase the sustainability of a smart grid and reduce overall operational costs.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2000.11c
• /
• pp.764-769
• /
• 2000

A new transplant production system that produces high quality plug seedlings of specific crop has been studied. It is a plant factory designed to produce massive amount of virus free seedlings. The design concept for building this plant factory is to realize maximum energy efficiency and minimum initial investment and running cost. The basic production strategy is the sitespecific management. In this case, the management of the growth of individual plantlet is considered. This requires highly automated and information intensive production system in a closed aseptic environment the sterilized specific crops. One of the key components of this sophisticated system is the irrigation system. The conditions that this irrigation system has to satisfy are: 1. to perform the site specific crop management in irrigation and 2. to meet the no waste standard. The objective of this study is to develop an irrigation scheduling that can implement the no waste standard.

• Journal of Korean Society for Quality Management
• /
• v.28 no.1
• /
• pp.196-209
• /
• 2000

In order to intensify an enterprise competition, quality inspection controls are very important issue. An organization or division of a company hopes which to acquire the quality inspection information be updated in real-time with respect to shop floor. In this paper, we develop a quality inspection control system for a Turbine/Generator production industry. The system compromises inspection scheduling module related to shop floor control (SFC) system, formal documentation control module, and formal inspection control module. In the quality inspection control system, ORACLE RDBMS is used for the database management system and ORACLE DEVELOPER 2000 is used for system development tool. The characteristic of this system is to support so it can enhance productivity and quality through inspection plans related to production scheduling.

• Korean Management Science Review
• /
• v.15 no.2
• /
• pp.201-210
• /
• 1998

Truck dispatching is one of the most commonly occurring problems of transprot management. We developed an interactive decision support system named IDSSTD, for the truck dispatching problem where two conflicting objectives are treated and travel speed varies depending on the passing areas and time of day. The IDSSTD aids the decision-making process by allowing the user to interact directly with the database, to direct data to a decision model, and to portray results in a convenient form. The IDSSTD is consisted of two major interactive phases. The pre-scheduling interactive phase is to reduce the complexity of a given problem before applying the BC-saving heuristic algorithm and the post-scheduling interactive phase is to improve practically the algorithmic solution. The IDSSTD has the capabilities of its own manipulation(analysis and recommendation) and diverse graphic features in order to facilitate a user's interaction.

• Journal of Construction Engineering and Project Management
• /
• v.3 no.2
• /
• pp.21-34
• /
• 2013

Various risk factors affect construction projects. Due to the uncertainties created by risk factors, actual activity durations frequently deviate from the estimated durations in either favorable or adverse direction. For this reason, evaluation of schedule uncertainty is required to make decisions accurately when managing construction projects. In this regard, this paper presents a new computer simulation model - the Repetitive Schedule Risk Analysis Model (RSRAM) - to evaluate unit-based repetitive building project schedules under uncertainty when activity durations and risk factors are correlated. The proposed model utilizes Monte Carlo Simulation and a Critical Path Method based repetitive scheduling procedure. This new procedure concurrently provides the utilization of resources without interruption and the maintenance of network logic through successive units. Furthermore, it enables assigning variable production rates to the activities from one unit to another and any kind of relationship type with or without lag time. Details of the model are described and an example application is presented. The findings show that the model produces realistic results regarding the extent of uncertainty inherent in the schedule.

• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.13-20
• /
• 2012

This paper considers a revenue maximization problem on a single processor. Each job is identified as its processing time, initial reward, reward decreasing rate, and preferred start time. If the processor starts a job at time zero, revenue of the job is its initial reward. However, the revenue decreases linearly with the reward decreasing rate according to its processing start time till its preferred start time and finally its revenue is zero if it is started the processing after the preferred time. Our objective is to find the optimal sequence which maximizes the total revenue. For the problem, we characterize the optimal solution properties and prove the NP-hardness. Based upon the characterization, we develop a branch-and-bound algorithm for the optimal sequence and suggest five heuristic algorithms for efficient solutions. The numerical tests show that the characterized properties are useful for effective and efficient algorithms.

• Proceedings of the Safety Management and Science Conference
• /
• 2002.11a
• /
• pp.233-238
• /
• 2002

The product process is sequence of all the required activities that a company must perform to develop, and manufacture a product. These activities include marketing, research, engineering design, quality assurance, manufacturing, and a whole chain of suppliers and vendors. The process also comprises all strategic planning, capital investments, management decisions, and tasks necessary to create a new product. manufacturing processes must be created so that the product can be produced in the product facility Purchasing new equipment and training workers may be required if new technology is to be used. Tools, fixtures, and the sequence of steps in the manufacturing processes must all be developed to allow rapid, high-quality, cost effective production. Also, it may be needed to be rearrange the production facility to adapt to the new manufacturing processes. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.98-102
• /
• 2002

High-Tech 산업은 국제적인 경쟁력과 갈수록 짧아지는 제품의 Life-cycle로 인해 그 경쟁이 매우 치열해 지고 있다. 따라서. 변동되는 시장 상황에 맞추어 자재의 구매/조달, 연구 개발, 생산, 물류/배송, 판매, 및 고객에 대한 납기 약속 등을 신속하고 정확하게 처리하기 위해 전 세계적으로 SCM(Supply Chain Management)관점에서 APS(Advanced Planning and Scheduling)시스템을 사영하고 있다. 특히, 고객으로부터 주문량이 할당되면 주어진 자재와 공장의 생산능력 (capacity)을 계산하여 생산가능 유무 및 생산가능일을 알려주는 공장내의 생산 계획 및 스케줄링 방법은 현재는 물론 앞으로도 지속적으로 발전시켜야 될 부분으로서 그 중요성이 점점 확대되고 있다. 따라서, 본 연구에서는 High-Tech 산업 중에서 전자 산업의 요구 사항을 분석하고, 이러한 요구 사항들을 해결하기 위래 세계적으로SCM 시장에서 가장 많은 경쟁력을 가지고 있는 i2 Technologies사의 생산 계획 및 스케줄링 툴인 Factory Planner를 사용한 사례를 제시한다.

• Management Science and Financial Engineering
• /
• v.21 no.1
• /
• pp.1-9
• /
• 2015

We consider an m-machine flow shop scheduling problem to minimize the latest completion time, where processing times are uncertain. Processing time uncertainty is described through a finite set of processing time vectors. The objective is to minimize maximum deviation from optimality for all scenarios. Since this problem is known to be NP-hard, we consider it with an ordered property. We discuss optimality properties and develop a pseudo-polynomial time approach for the problem with a fixed number of machines and scenarios. Furthermore, we find two special structures for processing time uncertainty that keep the problem NP-hard, even for two machines and two scenarios. Finally, we investigate a special structure for uncertain processing times that makes the problem polynomially solvable.