• 산업공학
• /
• 제25권1호
• /
• pp.127-133
• /
• 2012

This paper considers the preventive maintenance scheduling problem of the cluster tool which is one of the most important manufacturing equipments in the next-generation semiconductor production environment. We define a random process that expresses the successive amount of chemicals accumulating inside the tool. Based on the renewal theory, we find the expected value and probability distribution of the time that the amount of accumulated chemicals exceeds a predetermined level. For a given probability that the accumulated chemicals exceeds the predetermined level we present a method to obtain the number of chamber operations to perform the preventive maintenance of that chamber. In addition, a method to get the preventive maintenance schedule for the whole cluster tool is presented. A numerical example is provided to illustrate our method.

• Management Science and Financial Engineering
• /
• 제13권2호
• /
• pp.47-77
• /
• 2007

This paper considers a scheduling problem where a customer orders multiple products(jobs) from a production facility. The objective is to minimize the sum of the order(batch) completion times. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. Although each job has a unique processing time, we consider the case where batch processing times are identical. This simplification allows us to develop heuristics with improved performance bounds. This problem was motivated by a real world problem encountered by foreign electronics manufacturers. We first establish the complexity of the problem. For the two parallel machine case, we introduce two simple but intuitive heuristics, and find their worst case relative error bounds. One bound is tight and the other bound goes to 1 as the number of orders goes to infinity. However, neither heuristic is superior for all instances. We extend one of the heuristics to an arbitrary number of parallel machines. For a fixed number of parallel machines, we find a worst case bound which goes to 1 as the number of orders goes to infinity. Then, a tighter bound is found for the three parallel machine case. Finally, the heuristics are empirically evaluated.

• 산업경영시스템학회지
• /
• 제43권4호
• /
• pp.23-32
• /
• 2020

Many small and medium-sized manufacturing companies process various product types to respond different customer orders in a single production line. To improve their productivity, they often apply batch processing while considering various product types, constraints on batch sizes and setups, and due date of each order. This study introduces a batch scheduling heuristic for a production line with multiple product types and different due dates of each order. As the process times vary due to the different batch sizes and product types, a recursive equation is developed based on a flow line model to obtain the upper bound on the completion times with less computational complexity than full computation. The batch scheduling algorithm combines and schedules the orders with same product types into a batch to improve productivity, but within the constraints to match the due dates of the orders. The algorithm incorporates simple and intuitive principles for the purpose of being applied to small and medium companies. To test the algorithm, two case studies are introduced; a high pressure coolant (HPC) manufacturing line and a press process at a plate-type heat exchanger manufacturer. From the case studies, the developed algorithm provides significant improvements in setup frequency and thus convenience of workers and productivity, without violating due dates of each order.

• 지능정보연구
• /
• 제11권3호
• /
• pp.83-101
• /
• 2005

고객유지는 갈수록 경쟁이 심화되고 있는 생명보험산업에서 핵심이슈 중에 하나이다. 생명보험사들은 고객을 유지하기 위해서 많은 활동들을 한다. 그 가운데 대표적인 것이 바로 지속적으로 고객과 접촉하는 것이다. 본 연구는 접촉스케줄링시스템(CSS: Contact Scheduling System)의 설계에 대한 것으로 해촉된 모집설계사의 고객을 관리해야만 하는 지원설계사의 고객관리를 돕는 것을 목표로 한다 지원설계사는 모집설계사의 고객관리 경험과 지식을 공유할 수 없다. 이런 지원설계사의 고객접촉을 지원하기 위해서, 본 연구에서는 CSS를 설계한다. CSS설계는 두 단계로 이루어지고, CART(Classification And Regression Tree)와 SPM(Sequential Pattern Mining)의 데이터 마이닝 기법을 활용한다. 단계 1에서는 CART 기법을 이용하여 고객을 8개의 고객군으로 분류한다. 단계 2에서는 각 분류고객군에 적합한 접촉내용, 접촉간격 그리고 접촉방법 등의 접촉스케줄링 정보를 생성한다. 접촉내용은 스케줄 접촉내용, 이벤트접촉내용 그리고 비즈니스규칙에 의한 접촉내용의 결합으로 결정되는데 스케줄접촉내용은 SPM 모델의 결과를 통해 생성된다. 또한 본 연구에서 설계한 CSS가 실제상황에서 어떻게 작동하는지를 제시함으로써 CSS가 효율적이고 효과적인 고객접촉에 실용적임을 보인다.

• 산업경영시스템학회지
• /
• 제23권56호
• /
• pp.19-34
• /
• 2000

Impact of business process re-engineering requires the fundamental rethinking of how information systems are analyzed and designed. It is no longer sufficient to establish a monolithic system for fixed business environments. Information systems must be adaptive in nature. This demand is also applied in production domain. Enabling concept for the adaptive information system is reusability. This paper presents a new object-oriented analysis process for creating such reusable software components in production domain, especially for production planning and scheduling. Our process called MeCOMA is based on three meta-models: physical object meta-model, data object meta-model, and activity object meta-model. After the three meta-models are extended independently for a given production system, they are collaboratively integrated on the basis of integration pattern. The main advantages of MeCOMA are (1) to reduce software development time and (2) to consistently build reusable production software components.

• 대한안전경영과학회지
• /
• 제15권2호
• /
• pp.193-204
• /
• 2013

The growing logistics strategy of a company is to optimize their vehicle route scheduling in their supply chain system. It is very important to analyze for continuous pickups and delivery vehicle scheduling. This paper is a computational study to investigate the effectiveness of continuous pickups and delivery vehicle routing problems. These scheduling problems have 3 subproblems; Inbound Vehicle Routing Problem with Makespan and Pickup, Line-haul Network Problem, and Outbound Vehicle Routing Problem with Delivery. In this paper, we propose 5 heuristic Algorithms; Selecting Routing Node, Routing Scheduling, Determining Vehicle Type with Number and Quantity, and Modification Selecting Routing Node. We apply these Algorithms to S vehicle company. The results of computational experiments demonstrate that proposed methods perform well and have better solutions than other methods considering the basic time and due-date.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 1998년도 창립기념 춘계학술대회 논문집
• /
• pp.23-30
• /
• 1998

The construction of the transportation history database system is to serve the scheduling and seat inventory controling. Recently, lots of countries have been faced with the advance era because of the new railway transportation system, like the high speed railway and/or magnetic levitation vehicle system. This can be reasonably translated as those of operators are willing to provide the more various and high quality schedule to the customer. Those operators' these ideas make possible to forecast that scheduling process is going to be complicated more and more The seat inventory control, so to speak Yield Management System(YMS), goes a long way to improve the total passenger revenue at the railway business. The YMS forecasts the number of the last reservation value(DCP# END) and recommends the optimal values on the seat sales. The history database system contains infra-data(ie, train, seat, sales) that will be the foundation of scheduling and seat inventory control application programs. The development of the application programs are reserved to the next step. The database system is installed on the pc platform(IBM compatible), using the DB2(RDBMS). And at next step, the platform and DBMS will be considered whether they can meet the users' requirement or not.

• 대한안전경영과학회지
• /
• 제19권1호
• /
• pp.181-189
• /
• 2017

The systematic management of technology infrastructure increasingly becomes critical as it represents the driving power for creating competitive advantage of nations and enterprises. In this sense, public facility and equipment, which is one major asset of technology infrastructure, should be managed effectively, systematically and efficiently to increase its overall equipment effectiveness. However, the manual and off-line communication was the unique way to communicate between the suppliers who provide facilities in the public sector and the customers who utilize the facilities in the industrial sector. This communication way caused invisibility of available usage time and increase of idle time, thereby decreasing the equipment effectiveness. This paper presents an web-based scheduling system that enables real-time collaboration and information sharing for increasing the equipment effectiveness. The designed system performs scheduling, facility management, order management and customer relationship management in an on-line platform, and carries out the processing and storing of relevant information in an integrated database. The paper includes a development approach to identify business process models and standardized system models by using object-modeling technique. The deliverable of the present work will contribute to increasing the equipment effectiveness by enhancing visibility, transparency and predictability by means of the integration with a legacy Enterprise Resource Planning.

• 한국전자거래학회지
• /
• 제10권1호
• /
• pp.61-80
• /
• 2005

업무프로세스관리(BPM) 시스템은 업무프로세스의 효율적인 실행, 통제 및 관리를 지원하는 소프트웨어 시스템으로서, 복잡한 프로세스를 자동화하고, 이를 효과적으로 관리하여 기업의 생산성 향상에 기여한다. 그러나, 상용시스템은 주로 프로세스의 자동화에 초점을 두고 있어 프로세스와 업무참여자 관점에서 효율적인 관리 방법을 제공하지 못하고 있다. 따라서, BPM 시스템은 프로세스 참여자와 전체 프로세스 효율성 향상의 관점에서 개선의 여지가 있다. 이에 본 논문에서는 업무프로세스를 보다 효율적으로 관리하는 새로운 방법을 제안한다. 제안한 방법은 업무참여자의 업무부하를 고려하여 전체 프로세스를 실행하는 방식으로서, 프로세스 참여자원 가운데 가장 큰 제약요소를 집중관리한다. 이러한 방식은 경영혁신이론으로 알려진 제약이론(Theory of Constraints)의 DBR (Drum-Buffer-Rope) 방법론을 기반으로 하고 있다. DBR 방법론을 활용하기 위해 우선, 업무프로세스와 DBR의 주적용모델의 차이점을 분석하고 업무프로세스에 적합한 드럼, 버퍼, 로프를 개발한다. 이를 토대로, 업무참여자의 업무부하와 프로세스 인스턴스 발생 패턴을 통제하는 BPM만의 DBR 방법론(BP-DBR, Business Process-DBR)을 제안한다. BP-DBR은 업무참여자의 업무환경과 전체프로세스의 효율성 개선에 기여할 것으로 기대한다. 이러한 기대효과를 증명하기 위해 기존 BPM의 프로세스 관리방법과 제안한 방법의 효과를 시뮬레이션 실험을 통해 비교한다.

• 한국전자거래학회지
• /
• 제24권3호
• /
• pp.19-33
• /
• 2019

최근 제조업체들은 제품의 생산방식이 고도화 되고, 복잡해지면서 생산 장비를 효율적으로 사용하는데 어려움을 겪고 있다. 제조공정의 효율성을 방해하는 대표적인 요인들로는 작업물 종류 변경(job change)으로 인한 작업 준비 비용(Setup Cost) 등이 있다. 특히 반도체/LCD 공정과 같이 고가의 생산 장비를 사용하는 공정의 경우 장비의 효율적인 사용이 매우 중요한데, 상호 충돌하는 의사결정인 납기 준수를 최대화 하는 것과 작업물 종류 변경으로 인한 작업 준비 비용을 최소화 하는 것 사이에서 균형을 유지하는 것은 매우 어려운 일이다. 본 연구에서는 납기와 작업 준비 비용이 있는 병렬기계에서 강화학습을 활용하여 납기 및 셋업 비용의 최소화 목표를 달성하는 일정계획 모델을 개발하였다. 제안하는 모델은 DQN(Deep Q-Network) 일정계획 모델로 강화학습기반의 모델이다. 제안모델의 효율성을 측정하기 위해 DQN 모델과 기존에 개발하였던 심층 신경망 기반의 일정계획 생성기법과 휴리스틱 원칙의 결과를 비교하였다. 비교 결과 DQN 일정계획 생성기법이 심층신경망 방식과 휴리스틱 원칙에 비하여 납기 및 셋업 비용이 적은 것을 확인할 수 있었다.