• Title/Summary/Keyword: Maintenance Scheduling

Search Result 158, Processing Time 0.028 seconds

Hierarchical Control Scheme in Flexible Manufacturing Systems That have unreliable Machines and Maintenance (기계고장과 보전(保全)을 고려한 유연생산시스템의 계층적 통제계획)

  • Um, Wan-Sup
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.22 no.4
    • /
    • pp.619-631
    • /
    • 1996
  • This paper describes an approach for the incorporation of maintenance times into a hierarchical scheduling for a failure prone flexible manufacturing system. The maintenance should not be performed too often because of the resulting reduction of capacity. Most manufacturing systems are large and complex. It is natural to divide the control into a hierarchy consisting of a number of different levels. Each level is characterized by the length of the planning horizon and the kind of data required for the decision making process. The goal of the analysis reported here is to calculate the production requirements while the machines fail and are repaired at random times. The machine failure and preventive maintenance are considered simultaneously.

  • PDF

Method of Generator Maintenance Scheduling Considering Transmission System (송전계통을 고려한 발전기 예방정비계획 방법론에 관한 연구)

  • Han, Seok-Man;Shin, Young-Kyun;Kim, Bal-Ho H.
    • Proceedings of the KIEE Conference
    • /
    • 2004.11b
    • /
    • pp.104-106
    • /
    • 2004
  • In competitive electricity markets, the System Operator (SO) coordinates the overall maintenance schedules whenever the collective maintenance schedule reported to SO by Gencos in the pool does not satisfy the specified operating criteria, such as system reliability or supply adequacy. In this paper, we divide maintenance schedule problem into master-problem and sub-problem. Master-problem is schedule coordination and sub-problem is DC-optimal power flow. If sub-problem is infeasible, we use the algorithm of modifying operating criteria of master-problem.

  • PDF

Developing a dynamic programming model for aircraft-engine maintenance scheduling (항공기 엔진 정비 일정 수립을 위한 동적 계획 모델 개발)

  • 주성종;신상헌
    • Korean Management Science Review
    • /
    • v.13 no.3
    • /
    • pp.163-172
    • /
    • 1996
  • According to flying hours, aircraft engines require regular overhaul for preventive maintenance. Because of hostile defense environment of Republic of Korea, the aircraft of republic of Korea Air Force(ROKAF) have been operated at the maximum level of availability and have similar overhaul schedule in several months. The concentration of overhaul schedule in a short period demands additional spare engines far exceeding the spare engines for corrective maintenance. If ROKAF decides to purchase extra engines for the preventive maintenance, the extra engines will be used only for the preventive maintenance and will be excess inventory for the most of aircraft life ccle. Also, the procurement of extra engines is significant investment for ROKAF. To help ROKAF schedule the preventive maintenance without significant spending, this study develops a dynamic programming model that is solvable using an integer programming algorithm. The model provides the number of engines that should be overhauled for a month for multiple periods under given constraints. ROKAF actually used this model to solve a T-59 engine overhaul problem and saved about three billion won at one time. ROKAF plans to use this model continuously for T-59 and other weapon systems. Thus, saving for long term will be significant to ROKAF. Finally, with minor modification, this model can be applied to deciding the minimum number of spare engines for preventive maintenance.

  • PDF

Transporter Scheduling Based on a Network Flow Model for Dynamic Block Transportation Environment (동적 블록수송환경을 위한 네트워크 흐름모형 기반의 트랜스포터 일정계획)

  • Lee, Woon-Seek;Lim, Won-Il;Koo, Pyung-Hoi
    • IE interfaces
    • /
    • v.22 no.1
    • /
    • pp.63-72
    • /
    • 2009
  • This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

Transporter Scheduling for Dynamic Block Transportation Environment (동적 블록수송환경을 위한 트랜스포터 일정계획)

  • Lee, Woon-Seek;Lim, Won-Il;Koo, Pyung-Hoi;Joo, Cheol-Min
    • IE interfaces
    • /
    • v.21 no.3
    • /
    • pp.274-282
    • /
    • 2008
  • This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition or cancellation of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times : 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose heuristic algorithms which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Four heuristic algorithms for transporter scheduling are proposed and their performance is evaluated.

Development of Agent-based Platform for Coordinated Scheduling in Global Supply Chain (글로벌 공급사슬에서 경쟁협력 스케줄링을 위한 에이전트 기반 플랫폼 구축)

  • Lee, Jung-Seung;Choi, Seong-Woo
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.213-226
    • /
    • 2011
  • In global supply chain, the scheduling problems of large products such as ships, airplanes, space shuttles, assembled constructions, and/or automobiles are complicated by nature. New scheduling systems are often developed in order to reduce inherent computational complexity. As a result, a problem can be decomposed into small sub-problems, problems that contain independently small scheduling systems integrating into the initial problem. As one of the authors experienced, DAS (Daewoo Shipbuilding Scheduling System) has adopted a two-layered hierarchical architecture. In the hierarchical architecture, individual scheduling systems composed of a high-level dock scheduler, DAS-ERECT and low-level assembly plant schedulers, DAS-PBS, DAS-3DS, DAS-NPS, and DAS-A7 try to search the best schedules under their own constraints. Moreover, the steep growth of communication technology and logistics enables it to introduce distributed multi-nation production plants by which different parts are produced by designated plants. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. No standard coordination mechanism of multiple scheduling systems exists, even though there are various scheduling systems existing in the area of scheduling research. Previous research regarding the coordination mechanism has mainly focused on external conversation without capacity model. Prior research has heavily focuses on agent-based coordination in the area of agent research. Yet, no scheduling domain has been developed. Previous research regarding the agent-based scheduling has paid its ample attention to internal coordination of scheduling process, a process that has not been efficient. In this study, we suggest a general framework for agent-based coordination of multiple scheduling systems in global supply chain. The purpose of this study was to design a standard coordination mechanism. To do so, we first define an individual scheduling agent responsible for their own plants and a meta-level coordination agent involved with each individual scheduling agent. We then suggest variables and values describing the individual scheduling agent and meta-level coordination agent. These variables and values are represented by Backus-Naur Form. Second, we suggest scheduling agent communication protocols for each scheduling agent topology classified into the system architectures, existence or nonexistence of coordinator, and directions of coordination. If there was a coordinating agent, an individual scheduling agent could communicate with another individual agent indirectly through the coordinator. On the other hand, if there was not any coordinating agent existing, an individual scheduling agent should communicate with another individual agent directly. To apply agent communication language specifically to the scheduling coordination domain, we had to additionally define an inner language, a language that suitably expresses scheduling coordination. A scheduling agent communication language is devised for the communication among agents independent of domain. We adopt three message layers which are ACL layer, scheduling coordination layer, and industry-specific layer. The ACL layer is a domain independent outer language layer. The scheduling coordination layer has terms necessary for scheduling coordination. The industry-specific layer expresses the industry specification. Third, in order to improve the efficiency of communication among scheduling agents and avoid possible infinite loops, we suggest a look-ahead load balancing model which supports to monitor participating agents and to analyze the status of the agents. To build the look-ahead load balancing model, the status of participating agents should be monitored. Most of all, the amount of sharing information should be considered. If complete information is collected, updating and maintenance cost of sharing information will be increasing although the frequency of communication will be decreasing. Therefore the level of detail and updating period of sharing information should be decided contingently. By means of this standard coordination mechanism, we can easily model coordination processes of multiple scheduling systems into supply chain. Finally, we apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly- plant-scheduling agents, and a meta-level coordination agent. A series of experiments using the real world data are used to empirically examine this mechanism. The results of this study show that the effect of agent-based platform on coordinated scheduling is evident in terms of the number of tardy jobs, tardiness, and makespan.

Generator Maintenance Scheduling for Bidding Strategies in Competitive Electricity Market (경쟁 전력시장에서 발전기 유지보수계획을 고려한 입찰전략수립)

  • 고용준;신동준;김진오;이효상
    • Journal of Energy Engineering
    • /
    • v.11 no.1
    • /
    • pp.59-66
    • /
    • 2002
  • The vertically integrated power industry was divided into six generation companies and one market operator, where electricity trading was launched at power exchange. In this environment, the profits of each generation companies are guaranteed according to utilizing strategies of their own generation equipments. This paper presents on generator maintenance scheduling and efficient bidding strategies for generation equipments through the calculation of the contract and the application of each generator cost function based on the past demand forecasting error and market operating data.

Study of Reliability Analysis Based Power Generation Facilities Maintenance System - Focused on Continuous Ship Unloader - (신뢰성 분석 기반 발전설비 점검계획 수립 시스템 연구- 석탄 하역기를 중심으로 -)

  • Hwang Seong Hwan;Kim Yu Rim;Kang Sung Woo
    • Journal of Korean Society for Quality Management
    • /
    • v.51 no.2
    • /
    • pp.315-327
    • /
    • 2023
  • Purpose: Recently, research has continued to predict the time of failure of the facility through measurement data obtained by attaching a sensor to the facility. However, depending on the facility, it may be difficult to attach a sensor. The purpose of this study is to propose a power generation maintenance plan system based on failure record data obtained from Continuous Ship Unloader, one of the facilities that is difficult to attach sensors. Methods: This study uses data collected from 2012 to 2022 from the 'CSU-1B' model among Continuous Ship Unloader operated by Korea Midland Power Co., LTD. By fitting fault record data to the Weibull distribution, appropriate maintenance cycles and ranges for each target facility subsystem are derived. In addition, maintenance group between subsystems is selected through Euclidean distance, a metric often used for time series data similarity. Through this, a system for establishing an maintenance plan for power generation facilities is proposed. Results: The results of this study are as follows. For the 17 subsystems of the Continuous Ship Unloader, proper maintenance cycles and ranges were determined, and a total of four maintenance groups were chosen. This resulted in the creation of an power generation maintenance plan system and the establishment of an maintenance plan. Conclusion: This study is a case study of power generation facilities. We proposed a maintenance plan system for Continuous Ship Unloader among power generation facilities.

Optimal maintenance scheduling of pumps in thermal power stations through reliability analysis based on few data

  • Nakamura, Masatoshi;Kumarawadu, Priyantha;Yoshida, Akinori;Hatazaki, Hironori
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10a
    • /
    • pp.271-274
    • /
    • 1996
  • In this paper we made a reliability analysis of power system pumps by using the dimensional reduction method which over comes the problem due to unavailability of enpugh data in the actual systems under many different operational environments. Hence a resonable method was proposed to determine the optimum maintenance interval of given pump in thermal power stations. This analysis was based on an actual data set of pumps for over ten years in thermal power stations belonged to Kyushu Electric Power Company, Japan.

  • PDF

A Heuristic Algorithm for Minimizing Maintenance Workforce Level (정비작업 인력 수준 최소화를 위한 발견적 기법)

  • Chang, Soo-Y.;Hong, Yu-Shin;Kim, Jung-Hoe;Kim, Se-Rae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.1
    • /
    • pp.47-55
    • /
    • 1999
  • This paper develops an efficient heuristic algorithm for scheduling workforce level that can accommodate all the requested maintenance jobs. Each job has its own release and due dates as well as man-day requirement, and must be scheduled in a non-interrupted time interval, namely, without preemption. Duration of each job is not fixed, but to be determined within given specific range. The objective is to minimize workforce level to complete all the requested maintenance jobs. We show that the problem can be seen as a variant of the two-dimensional bin-packing problem with some additional constraints. A non-linear mixed integer programming model for the problem is developed, and an efficient heuristic algorithm based on bin-packing algorithms is proposed. In order to evaluate goodness of the solution obtained from the proposed algorithm, a scheme for getting a good lower bound for the optimum solution is presented and analyzed. The computational experiment shows that the proposed algorithm performs quite satisfactorily.

  • PDF