• Title/Summary/Keyword: Priority Rules

Search Result 126, Processing Time 0.027 seconds

BIM-based Design Verification Performance Analysis with Priority Rules Applied (우선순위 규칙을 적용한 BIM 기반 설계검증 성과 분석)

  • Huh, Seung-Ha;Shim, Jae-Hyeong;Ham, Nam-Hyuk;Kim, Jae-Jun
    • Journal of KIBIM
    • /
    • v.11 no.3
    • /
    • pp.1-11
    • /
    • 2021
  • BIM is one of the means of reducing the economic loss caused by design errors. These features of BIM have led to increased use of BIM. With the increasing use of BIM, several studies have been conducted to analyze the performance of BIM. As the importance of BIM staff is emphasized in the performance analysis of BIM, the human resource allocation of BIM staff can become an important research issue. However, there are few studies to measure the workforce effectiveness of BIM staff. Ham et al (2020) measured BIM workforce efficiency using FCFS queue model rules. Since design errors can have different effects on the project depending on the type, there are design errors that must be dealt with first. Therefore, in this study, a priority queue was used to solve design errors with high priority first. The performance of BIM-based design verification was analyzed by quantitatively analyzing the performance of BIM staff when the priority rule was applied to the design error processing sequence.

Developing an Optimization Module for Water, Energy, and Food Nexus Simulation

  • Wicaksono, Albert;Jeong, Gimoon;Kang, Doosun
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2017.05a
    • /
    • pp.184-184
    • /
    • 2017
  • A nation-wide water-energy-food (WEF) nexus simulation model has been developed by the authors and successfully applied to South Korea to predict the sustainability of those three resources in the next 30 years. The model was also capable of simulating future scenarios of resources allocation based on priority rules aiming to maximize resources sustainability. However, the process was still relying on several assumptions and trial-and-error approach, which sometimes resulted in non-optimal solutions of resources allocation. In this study, an optimization module was introduced to enhance the model in generating optimal resources management rules. The objective of the optimization was to maximize the reliability index of resources by determining the resources' allocation and/or priority rules for each demand type that accordingly reflect the resources management policies. Implementation of the optimization module would result in balanced allocation and management of limited resources and assist the stakeholders in deciding resources' management plans, either by fulfilling the domestic production or by global trading.

  • PDF

Priority Assignment Procedure in Multi-Product Disassembly

  • Min, Sundong;Matsuoka, Shinobu;Muraki, Masaaki
    • Industrial Engineering and Management Systems
    • /
    • v.3 no.1
    • /
    • pp.12-21
    • /
    • 2004
  • This paper investigates the design of a priority rule in a multi-product disassembly environment. Specifically, it is concerned with product scheduling by which the inventory control of disassembled parts can be incorporated into a priority rule to reduce part lead times. The part lead time consists of two components: flow time and supply delay. The primary focus of the paper is on the development of a disassembly priority rule that aims to reduce the supply delay. We propose a priority rule, called Minimum Distance (MD) rule, to improve the supply delay performance. Finally, we provide a comparative analysis on the performance of traditional rules and the new rule proposed in this paper via a simulation model.

A Parallel Matching in AI Production Systems (인공지능 생성시스템에서의 병렬 매칭)

  • 강승일;윤종민;정규식
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.3
    • /
    • pp.89-99
    • /
    • 1995
  • One of the hardest problems that limit real application of production system is its slowness. One way to overcome this problem is to speed up the matching operation which occupies more than 90% of the total execution time. In this paper, we try to speed up the matching operation with parallel execution of a typical pattern matching algorithm, RETE, in a multiprocessor environment, This requires not only to make partitions of the rules but also to allocate the partitioned rules to processors, respectively. A partition strategy is proposed to make groups of similar rules by evaluating the similarity of rules according to the number of common conditions between rules. An allocation strategy is proposed to make the load of each processor even by assigning the different priority to the group of rules according to the expected amount of time required for matching operation. To compare with the existing methods, we perform simulation using OPS5 sample programs. The simulation results show that the proposed methods can improve the performance of production system.

  • PDF

A SIMULATION/OPTIMIZATION ALGORITHM FOR AN FMS DISPATCHING PRIORITY PROBLEM

  • Lee, Keun-Hyung;Morito, Susumu
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1993.10a
    • /
    • pp.16-16
    • /
    • 1993
  • The efficient use of capital intensive FMS requires determination of effective dispatching priority with which the parts of the selected part types are to be inputed into the system. This paper presents a simulation-optimization approach to find an appropriate dispatching priority. The study is based on a detailed simulator for a module-type commercial FMS, Specifically, after presenting the basic configuration and fundamental control logic of the system together with its main characteristics as a special type of a job shop, an algorithm is presented which combines simulated annealing and simulation to explore a dispatching priority of operations that minimizes the total tardiness, Computational performance of the algorithm shows that good solutions can be obtained within a reasonable amount of computations. The paper also compares the performance of the "optimal" or near optimal dispatching priority generated by the proposed algorithm with those generated by standard dispatching rules such as SPT, EDD and SLACK.

  • PDF

A Novel Investment Priority Decision Method for Facilities of Distribution Systems Considering Reliability of Distribution System (신뢰도를 고려한 배전계통 설비투자 우선순위 결정에 관한 연구)

  • Choi Jung Hwan;Park Chang Ho;Kim Kwang Ho;Jang Sung il;Cho Sung Hyeon
    • Proceedings of the KIEE Conference
    • /
    • summer
    • /
    • pp.545-547
    • /
    • 2004
  • This paper proposes the novel investment priority decision method for distribution facilities considering the potential failure rate and the influence of customer caused by faults in distribution networks. The Proposed method decides the investment priority of the facilities combining, by the fuzzy rules, the KEPCO's priority decision for investment and the priority decision considering SAIFI(System Average Interruption Frequency Index) and SAIDI(System Average Interruption Duration Index). To verify the performance of the proposed method, these works utilized the projects for weak facility reinforcement planned in KEPCO in the Busan region in 2003 and 2004. The evaluation results showed that the reliability of the KEPCO in the Busan region using the proposed method can be enhanced more than using the conventional KEPCO's method.

  • PDF

Strategic Allocation of the Limited Same Resource by Program Management Office Considering Financial Values (재무 가치를 고려한 PMO의 전략적 동일 한정 자원 배분)

  • Hwang, Jin-Ha;Kim, Ju-Han;Hwang, Jee-Yeon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.3
    • /
    • pp.24-31
    • /
    • 2012
  • Priority rules or sequencing heuristics conventionally used to determine resource allocation is to maximize the earned value on time and cost. This study provides a effective strategy-oriented approach for the program resource management problem with limited same resource, which systematically connects individual project objectives to the overall organizational goal, by introducing financial values as well as priority rules in a broader context. It deals with the resource allocation problem as the decision making problem in the strategic management paradigm to meet business objective and solves it using the analytic hierarchy process, and explains the method of application and usefulness through some simulation cases.

Dispatching Rule based on Chromaticity and Color Sequence Priorities for the Gravure Printing Operation (색도 및 색순에 따른 그라비아 인쇄 공정의 작업 순서 결정 규칙)

  • Bae, Jae-Ho
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.3
    • /
    • pp.10-20
    • /
    • 2020
  • This paper presents a method to measure the similarity of assigned jobs in the gravure printing operation based on the chromaticity and color sequence, and order the jobs accordingly. The proposed dispatching rule can be used to fulfill diverse manufacturing site requirements because the parameters can be adjusted to prioritize chromaticity and color sequence. In general, dispatching rules either ignore the job-changing time or require that the time be clearly defined. However, in the gravure printing operation targeted in this study, it is difficult to apply the general dispatching rule because of the difficulties in quantifying the job-changing time. Therefore, we propose a method for generalizing assignment rules of the job planner, allocating relative similarity among assigned jobs, and determining the sequence of jobs accordingly. Chromaticity priority is determined by the arrangement of the color assignments in the printing operation; color sequence priority is determined by the addition, deletion, or change in a specific color sequence. Finally, the job similarity is determined by the dot product of the chromaticity and color sequence priorities. Implementation of the proposed dispatching rule at an actual manufacturing site showed the planner present the same job order as that obtained using the proposed rule. Therefore, this rule is expected to be useful in industrial sites where clear quantification of the job-changing time is not possible.

Best Effort Service in Wireless MAN (무선 MAN에서 Best Effort 서비스)

  • Park, Jin-Kyung;Kim, Joon-Mo;Choi, Cheon-Won
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.20-21
    • /
    • 2008
  • In the IEEE 802.16 Wireless MAN standard, the best effort service class is ranked on the lowest position in priority so that only scarce resource may be available for it. Also, the best effort service is usually assisted by a MAC scheme based on reservation ALOHA without explicit acknowledgement. However, the standard only specifies the skeleton of the MAC scheme. In this paper, we propose some rules to specify the indefinite part of the MAC scheme as well as to improve the throughput and delay performance of the MAC scheme. As generic rules for demanding and granting resource, we first propose non-gated exhaustive, gated exhaustive, non-gated limited, and gated limited demand rules, and deficient and full grant rules. Secondly, we propose grant regulation rules, identified as replacement and lifetime rules, to avoid excessive grant incurred by not giving acknowledgement. Noting the residual resource is inflated by adopting a grant regulation rule, we finally propose a rule for investing the residual resource to a subscriber station. Simulation results confirm that a combination of proposed rules improves the performance of the MAC scheme.

  • PDF