• Title/Summary/Keyword: minimal cost

Search Result 426, Processing Time 0.028 seconds

A Production and Preventive Maintenance Policy with Two Types of Failures (두 가지 고장형태를 고려한 생산 및 예방보전 정책)

  • 김호균;조형수
    • Journal of Korean Society for Quality Management
    • /
    • v.30 no.3
    • /
    • pp.53-65
    • /
    • 2002
  • This paper studies an economic manufacturing quantity (EMQ) model with two types of failures and planned preventive maintenance of the production facility. One is a type I (major) failure which should be corrected by a failure maintenance and the other is a type H (minor) failure which can be minimally repaired without interrupting the production run. The objective is to determine the lot size and preventive replacement policy minimizing the long-run expected cost per unit time. We consider a control policy with a constant production lot size and preventive maintenance after completing n production runs. It is assumed that both preventive and failure maintenance times are random and the demand arriving during a stock-out period is lost. An expression for the expected cost per unit time is obtained in the general case. A special case is discussed and numerical results are provided.

Design of an Automatic Synthesis System for Datapaths Based on Multiport Memories (다중포트 메모리를 지원하는 데이터패스 자동 합성 시스템의 설계)

  • 이해동;김용노;황선영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.7
    • /
    • pp.117-124
    • /
    • 1994
  • In this pape, we propose a graph-theoretic approach for solving the allocation problem for the synthesis of datapaths based on multiport memories. An efficient algorithm is devised by using the weighted bipartite matching algorithm to assign variables to each port of memory modules. The proposed algorithm assigns program variables into a minimum number of multiport memory modules such that usage of memory elements and interconnection cost can be kept minimal. Experimental results show that the proposed algorithm generates the datapaths with fewer registers in memory modules and less interconnection cost for several benchmarks available from the literatures.

  • PDF

Cost-Effective Design of Autonomous Chess Playing Robot for AI Research Platform (AI 연구 플랫폼을 위한 저비용 체스 로봇 설계)

  • Faraooq, Sehar Shahazad;Khalil, Hafiz M.W.;Arif, Adeel
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06b
    • /
    • pp.447-449
    • /
    • 2012
  • This paper present an intelligent microcontroller based chess playing robot which can play a board game against opponent and calculate its moves in a non-idealized environment. In this work, for the sake of simplicity task is accomplished by using Cartesian coordinate system. Chess playing system has been designed in such a way that it provides an interface between user and robot to control chess movements using RS232. Various algorithms are implemented for interfacing hardware in C++ language. Our main goal is to design a cost effective and highly accurate robot system that consumes minimal power to complete its task.

Computer Aided Design of Sequential Logic Circuits (Case of Synchronous Sequential Logic Circuits) (컴퓨터를 이용한 순차 논리 회로의 설계 (동기식 순차 논리 회로의 경우))

  • 김경식;조동섭;황희영
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.33 no.4
    • /
    • pp.134-139
    • /
    • 1984
  • This paper presents the computer program to design the synchronous sequential logic circuit. The computer program uses the MASK method to get the circuit of optimal cost. The computer program takes as an input, the minimal reduced state transition table where each state has its internal code. As an output,the optimal design of synchronous sequential logic circuit is generated for each flipflop type of JK,T,D, and RS respectively. And these circuits for 4 flipflop types are evaluated and sorted in ascending order of their costs, so that the user can select the proper flipflop type and its circuit. Furthermore,the proposed computer program may be applied to state assignment with its facility of cost evaluation.

  • PDF

Periodic PM Policy for Repairable System with RCW or NCW

  • Jung, Gi-Mum;Kim, Dae-Kyung;Park, Dong-Ho
    • International Journal of Reliability and Applications
    • /
    • v.3 no.3
    • /
    • pp.113-124
    • /
    • 2002
  • This paper suggests the optimal periodic preventive maintenance policies after the combination warranty is expired. After the combination warranty is expired, a repairable system undergoes PM periodically and is minimally repaired at each failure. And also the system is replaced by a new system at the N th PM. In this case, we derive the mathematical formula for the expected cost rate per unit time. The optimal number and period for the periodic PM that minimize the expected cost rate per unit time are obtained. Some numerical examples are presented for illustrate purpose.

  • PDF

Determination of an economical shipping route considering the effects of sea state for lower fuel consumption

  • Roh, Myung-Il
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.5 no.2
    • /
    • pp.246-262
    • /
    • 2013
  • With increases in international oil prices, the proportion of fuel cost to the operational costs of a ship is currently increasing. To reduce fuel cost, a method for determining an economical route for a ship based on the acquisition of the sea state and the estimation of fuel consumption is proposed. The proposed method consists of three items. The first item is to acquire the sea state information in real time. The second item is to estimate the fuel consumption of a ship according to the sea state. The last item is to find an economical route for minimal fuel consumption based on the previous two items. To evaluate the applicability of the proposed method, it was applied to routing problems in various ocean areas. The result shows that the proposed method can yield economical ship routes that minimize fuel consumption. The results of this study can contribute to energy savings for environmentally friendly ships.

A Decomposition Algorithm for Convex Structuring Elements in Morphological Operation (모폴로지 연산에 사용되는 볼록 구조요소의 분해를 위한 알고리듬)

  • 온승엽
    • Journal of the Korea Society for Simulation
    • /
    • v.13 no.1
    • /
    • pp.11-23
    • /
    • 2004
  • The decomposition of a structuring element for a morphological operation reduces the amount of the computation required for executing the operation. In this paper, we present a new technique for the decomposition of convex structuring elements for morphological operations. We formulated the linear constraints for the decomposition of a convex polygon in discrete space, then the constraints are applied to the decomposition of a convex structuring element. Also, a cost function is introduced to represent the optimal criteria for decomposition. We use linear integer programming technique to find the combination of basis structuring elements which minimizes the amount of the computation required for executing the morphological operation. Formulating different cost functions for different implementation methods and computer architectures, we can determine the optimal decompositions which guarantee the minimal amounts of computation on different computing environment.

  • PDF

Simulation Study on the Fuel Economy of Plug-in Type Hybrid Electric Vehicle (외부충전 방식 하이브리드 전기자동차의 연비 시뮬레이션)

  • 최득환;김현수
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.10 no.5
    • /
    • pp.121-128
    • /
    • 2002
  • In this paper, the fuel economy of plug-in type hybrid electric vehicle is investigated through simulation. For the simulation study, 2 shaft type parallel hybrid powertrain is chosen and its operation modes are described. The operation algorithm which yields operation points of minimal fuel cost is suggested. Dynamic model fur operation of HEV and simulation procedure is described. Simulation results of fuel economy is compared to non plug-in type HEV as well as conventional vehicle. With total driving distance of 37km and full usage of 2kwh of electric energy stored in battery pack, plug-in type HEV shows 28-30% improved fuel economy compared to non plug-in type HEV and 86-93% improved fuel economy compared to conventional vehicle.

Warranty Cost Models for a Product Subject to Two Types of Failure (두 가지 고장(故障) 형태(形態)를 가진 제품(製品)에 대한 보증비용(保證費用) 모형(模型))

  • Bae, Do-Seon;Kim, Su-Myeong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.14 no.2
    • /
    • pp.81-90
    • /
    • 1988
  • This paper is concerned with warranty cost models for a product with two types of failure ; type 1 failures corrected by minimal repair and type 2 failures removed only by replacement. Two warranty policies involving an initial free service period followed by a pro-rata period are considered ; the difference is whether the warranty is renewed or not when type 2 failure occures during its free service period. Expected warranty costs under the two policies are obtained, and their behaviors are examined for the case where type 1 and 2 failure distributions are Weibull and exponential, respectively.

  • PDF

MobPrice: Dynamic Data Pricing for Mobile Communication

  • Padhariya, Nilesh;Raichura, Kshama
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.2
    • /
    • pp.86-96
    • /
    • 2015
  • In mobile communication, mobile services [MSs] (e.g., phone calls, short/multimedia messages, and Internet data) incur a cost to both mobile users (MUs) and mobile service providers (MSPs). The proposed model MobPrice consists of dynamic data pricing schemes for mobile communication in order to achieve optimal usage of MSs at minimal prices. MobPrice inspires MUs to subscribe MSs with flexibility of data sharing and intra-peer exchanges, thereby reducing overall cost. The main contributions of MobPrice are three-fold. First, it proposes a novel k-level data-pricing (kDP) scheme for MSs. Second, it extends the kDP scheme with the notion of service-sharing-based pricing schemes to a collaborative peer-to-peer data-pricing (pDP) scheme and a cluster-based data-pricing (cDP) scheme to incorporate the notion of 'cluster' (made up of two or more MUs) in mobile communication. Third, our performance study shows that the proposed schemes are indeed effective in maximizing MS subscriptions and minimizing MS's price/user.