• 제목/요약/키워드: Priority based

검색결과 2,686건 처리시간 0.04초

ELV에서 재제조 부품을 회수하기 위한 해체 우선순위 (Disassembly Priority for Recoverying Remanufacturable Parts(Core) in ELV)

  • 손우현;박상진;목학수
    • 한국산업융합학회 논문집
    • /
    • 제22권6호
    • /
    • pp.591-598
    • /
    • 2019
  • Today, due to the development of the industrial society, the need for sustainable research and development for energy depletion and environmental protection is increasing. Among sustainable research, remanufacturing is an ideal way to meet environmental and economic aspects. In this paper, we investigated the End-of-Life Vehicle(ELV) in order to find the recovery method of the core which is the preceding stage of remanufacturing. The number of End-of-Life Vehicle is increasing year by year, but the core recovery rate from ELV is still low. Therefore, a methodology to determine the disassembly priority of each part is proposed to increase the core recovery rate. Based on the analysis Table through the disassembly process, the decision rule was selected and the weighted score evaluation Table was completed to complete the disassembly priority system. Finally, evaluation was made on gasoline vehicles to determine priorities.

품질의 이원론을 이용한 개선의 우선순위 결정 (Determination of Priority for Improvement Using the Theory of Two-dimensional Quality)

  • 송해근
    • 산업경영시스템학회지
    • /
    • 제36권1호
    • /
    • pp.70-77
    • /
    • 2013
  • The theory of two-dimensional quality, in particular, the Kano model that is developed by the analogy with the M-H theory, has been applied in various industry fields for more than three decades. Importance-Performance Analysis (IPA) assumes that the degree of physical fulfilment of quality attributes and the satisfaction of that attribute is linear, and therefore, it is applicable to the traditional one-dimensional attribute, not other quality types defined in the Kano's model such as attractive or must-be attribute. To solve this problem, the current study suggests a new importance-satisfaction analysis using a modified IPA in accordance with the three quality types and a diagonal method introduced by Slack (1999) to determine improvement priority. For this, I investigated 19 smartphone's quality attributes and conducted a survey of 334 university students for the results of Kano's model, which adopted from Song and Park (2012)'s study, and the importance/satisfaction of the quality attributes and the results of the priority for improvement of the 19 quality attributes. The results show that the proposed I-S priority model is better than the conventional IPA based on the comparison results of determination coefficient from the regression analysis of the two models.

Determining Attribute Importance Weights Using Priority for Improvement Model

  • Song, HaeGeun;Kong, MyungDal
    • 대한설비관리학회지
    • /
    • 제23권4호
    • /
    • pp.65-75
    • /
    • 2018
  • Importance-Performance Analysis(IPA) holds the assumption that the degree of physical fulfilment of quality attributes and the satisfaction of that attribute is linear. Therefore, IPA can be applied to the traditional one-dimensional attributes, not to other quality elements such as attractive or must-be attributes. To overcome this problem, several articles introduced methods that integrate IPA into the concept of two-dimensional quality. However, these articles are rather conceptual focusing on the differentiation of quality attributes depend on quality elements in IPA. To provide empirical evidence of the dependent relationship between attribute importance and satisfaction in IPA, this study introduces a weighted importance approach and provides validation method using Bacon's priority model, a regression model. For this, the current research investigates 23 quality attributes of TV set for the results of Kano's model, which are adopted from Kim et al., and conducted a survey of 118 university students for the results of the importance/satisfaction and improvement priority. The result of the proposed approach shows better result than those using the conventional way, based on R-square of the regression model.

RawPEACH: Multiband CSMA/CA-Based Cognitive Radio Networks

  • Chong, Jo-Woon;Sung, Young-Chul;Sung, Dan-Keun
    • Journal of Communications and Networks
    • /
    • 제11권2호
    • /
    • pp.175-186
    • /
    • 2009
  • A new medium access control (MAC) scheme embedding physical channels into multiband carrier sense multiple access/collision avoidance (CSMA/CA) networks is proposed to provide strict quality of service (QoS) guarantee to high priority users. In the proposed scheme, two priority classes of users, primary and secondary users, are supported. For primary users physical channels are provided to ensure strict QoS, whereas secondary users are provided with best-effort service using CSMA/CA modified for multiband operation. The performance of the proposed MAC scheme is investigated using a new multiband CSMA/CA Markov chain model capturing the primary user activity and the operation of secondary users in multiple bands. The throughput of secondary users is obtained as a function of the primary user activity and other CSMA/CA parameters. It is shown that the new MAC scheme yields larger throughput than the conventional single-band CSMA/CA when both schemes use the same bandwidth.

다중프로세서 시스템에 적합한 우선순위 할당 결정기법에 관한 연구 (Allocation Priority Scheme for Multiprocessor Systems)

  • 박영선;김화수
    • 한국국방경영분석학회지
    • /
    • 제17권2호
    • /
    • pp.113-122
    • /
    • 1991
  • This paper presents the Allocation Priority Scheme (APS) for multiprocessor system. The objective of APS is to reduce the time-complexity on a Physical Mapping Scheme(PMS). The PMS is to allocate the nodes of the Data Dependency Graph (DDG) to the multprocessors efficiently and effectively. The APS provides the priority to each node (vertex) in the DDG. In other words, the goal of the APS is to find a request resource mapping such that the total cost (time-complexity) is minimized. The special case in which all requests have equal priorities and all resoruces have equal precedences, and the comparisons between our APS and other schems are discussed in the paper. The APS provides the heuristic rules which are based on maximum height (MH), number of children nodes ($N_c$), number of father nodes ($N_f$), and computation time ($T_c$). The estimation moth of the computaion time is in the paper.

  • PDF

우선순위 제어기법을 기반으로 한 재순환 Shuffle-Exchage 상호연결 ATM 스위치 (Recirculating Shuffle-Exchange Interconnection ATM Switching Network Based on a Priority Control Algorithm)

  • 박병수
    • 한국정보처리학회논문지
    • /
    • 제7권6호
    • /
    • pp.1949-1955
    • /
    • 2000
  • This paper proposes a multistage interconnection ATM switching network without internal blocking. The first is recirculating shuffle-exchange network improved on hardware complexity. The next is connected to Rank network with tree structure. In this network, after the packets transferred to the same output ports are given each priority, only a packet with highest priority is sent to the next, an the others are recirculated to the first. Rearrangeability through decomposition and composition algorithm is applied for the transferred packets in hanyan network and all they arrive at a final destinations. To analyze throughput, waiting time and packet loss ratio according tothe size of buffer, the probabilities are modeled by a binomial distribution of packet arrival.

  • PDF

Multi-Item Inventory Problems Revisited Using Genetic Algorithm

  • Das, Prasun
    • Management Science and Financial Engineering
    • /
    • 제13권2호
    • /
    • pp.29-46
    • /
    • 2007
  • This paper makes an attempt to compare the two important methods for finding solutions of multi-item inventory problem with more than one conflicting objectives. Panda et al.[9] discusses a distance-based method to find the best possible compromise solution with variation of priority under the given weight structure. In this paper, the problem in [9] is revisited through the Pareto-optimal front of genetic algorithm with the help of a situation of retail stocking of FMCG business. The advantages of using the solutions from the perspective of the decision maker obtained through multi-objective optimization are highlighted in terms of population search, weighted goals and priority structure, cost, set of compromise solutions along with prevention of stock-out situation.

항만물류종합정보시스템의 재난복구 우선순위결정 : 퍼지 TOPSIS 접근방법 (Disaster Recovery Priority Decision of Total Information System for Port Logistics : Fuzzy TOPSIS Approach)

  • 김기윤;김도형
    • 한국IT서비스학회지
    • /
    • 제11권3호
    • /
    • pp.1-16
    • /
    • 2012
  • This paper is aimed to present a fuzzy decision-making approach to deal with disaster recovery priority decision problem in information system. We derive an evaluation approach based on TOPSIS(Technique for Order Performance by Similarity to Ideal Solution), to help disaster recovery priority decision of total information system for port logistics in a fuzzy environment where the vagueness and subjectivity are handled with linguistic terms parameterized by trapezoidal fuzzy numbers. This study applies the fuzzy multi-criteria decision-making method to determine the importance weight of evaluation criteria and to synthesize the ratings of candidate disaster recovery system. Aggregated the evaluators' attitude toward preference, then TOPSIS is employed to obtain a crisp overall performance value for each alternative to make a final decision. This approach is demonstrated with a real case study involving 4 evaluation criteria(system dependence, RTO, loss, alternative business support), 7 information systems for port logistics assessed by 5 evaluators from Maritime Affairs and Port Office.

지능망 구조에서 공정성과 우선순위를 보장하는 과부하 제어 연구 (Overload control of SCP in intelligne netowrk with fairness and priority)

  • 이용;송주석
    • 한국통신학회논문지
    • /
    • 제21권12호
    • /
    • pp.3098-3108
    • /
    • 1996
  • This paper proposed two mechanisms of fixed method and new arrival method. They are all interactive meachanisms in that a SCP and the SSPs exchange load information for overload control. These mechanisms using simple algorithm based on the standard ACG, apply differenct call gapping time on each SSP under the fairness scheme when they allocates SCP capacity to competing demends. Also in the mechanisms, priority scheme is implemented. Two mechanisms show the almost same results on the call throughput. Fairness about the probability of rejection is maintained same value on all SSPs. On Priority scheme, new arrival method has better achievement than fixed method.

  • PDF

멀티코어 시스템의 안정성 향상을 위한 피크파워 제어 알고리즘 (Peak Power Control for Improvement of Stability in Multi-core System)

  • 박성환;김재환;안병규;정일종;이석희;정정화
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • pp.747-748
    • /
    • 2008
  • In this paper, we propose a new algorithm for task scheduling consisting of subtask partitioning and subtask priority scheduling steps in order to keep the peak power under the system specification. The subtask partitioning stepis performed to minimize the idle operation time for processors by dividing a task into multiple subtasks using the least square method developed with power consumption pattern of tasks. In the subtask priority scheduling step, a priority is assigned to a subtask based on the power requirement and the power variation of subtask so that the peak power violation can be minimized and the task can be completed within the execution time deadline.

  • PDF