• Title/Summary/Keyword: Goal Programming

Search Result 294, Processing Time 0.026 seconds

Supporting Adaptability and Modularity of System Software

  • Netinant, Paniti
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1339-1342
    • /
    • 2002
  • It is difficult to design system software to meet a better separation of concerns, which can provide a number of benefits such as adaptability, extensibility, and modularity in the design and implementation. During design, some aspectual properties, such as synchronization, scheduling, performance and fault tolerance, crosscut the basic functionalities of the system software. By separating functional components from the different aspectual components of the system software in the design, we can provide a better generic design model of system software. Aspect-Oriented Programming is a methodology that aims at separating components and aspects from the early stages of the software life cycle, and using techniques to combining them together at the implementation phase. In this paper we discuss an aspect-oriented framework that can simplify system software design and implementation by expressing it at a higher level of abstraction. Our work concentrates on how to achieve a higher separation of aspectual components, functional components, and layers from each other. Our goal is to achieve a better design model for implementing system software in terms of modularity, reusability and adaptability.

  • PDF

A Comparison of Stacking Sequence Optimization Schemes;Genetic Algorithm and Branch and Bound Method (적층순서 최적화 알고리듬의 평가;유전 알고리듬과 분기법)

  • Kim, Tae-Uk;Shin, Jeong-Woo
    • Proceedings of the KSME Conference
    • /
    • 2003.04a
    • /
    • pp.420-424
    • /
    • 2003
  • Stacking sequence optimization needs discrete programming techniques because ply angles are limited to a fixed set of angles such as $0^{\circ},\;{\pm}45^{\circ},\;90^{\circ}$. Two typical methods are genetic algorithm and branch and bound method. The goal of this paper is to compare the methods in the light of their efficiency and performance in handling the constraints and finding the global optimum. For numerical examples, maximization of buckling load is used as objective and optimization results from each method are compared.

  • PDF

A loading and sequencing problem in a random FMS (다목적을 고려한 FMS작업할당/경로선정과 분배규칙에 관한 연구)

  • 장영기;조재용
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.19 no.37
    • /
    • pp.201-210
    • /
    • 1996
  • Although FMS implementation in Korea is not yet mature, the worldwide empirical data shows the diffusion of FMS is inevitable in near future. As the reletionships between the high capital cost and the relative benefits and advantages are complex to analyse, it is rather beneficial to prepare the effective operation strategies which exploit the FMS flexibility, such as machine loading with alternative routing and dispatching rules. This paper shows the formulation applying a goal programming model for the loading problem with objectives of minimizing the production cost and maximizing the machine utilization, including constraints such as machine tool capacity and demands, etc. A realistic random FMS model is developed for illustration. Since loading and dispatching are a composite of two interdependent tasks, simulation is made to investigate the interactions between the two.

  • PDF

Response Surface Approximation for Fatigue Life Prediction and Its Application to Compromise Decision Support Problem (피로수명예측을 위한 반응표면근사화와 절충의사결정문제의 응용)

  • Baek, Seok-Heum;Cho, Seok-Swoo;Jang, Deuk-Yul;Joo, Won-Sik
    • Proceedings of the KSME Conference
    • /
    • 2008.11a
    • /
    • pp.1187-1192
    • /
    • 2008
  • In this paper, a versatile multi-objective optimization concept for fatigue life prediction is introduced. Multi-objective decision making in engineering design refers to obtaining a preferred optimal solution in the context of conflicting design objectives. Compromise decision support problems are used to model engineering decisions involving multiple trade-offs. These methods typically rely on a summation of weighted attributes to accomplish trade-offs among competing objectives. This paper gives an interpretation of the decision parameters as governing both the relative importance of the attributes and the degree of compensation between them. The approach utilizes a response surface model, the compromise decision support problem, which is a multi-objective formulation based on goal programming. Examples illustrate the concepts and demonstrate their applicability.

  • PDF

간판시스템(JIT)에 있어서의 간판 매수 결정에 관한 연구

  • ;Fukuawa, Tada Aki
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1990.04a
    • /
    • pp.186-194
    • /
    • 1990
  • Just-In-Time production is to keep the kanban system. When production managers implement and operate successfully the system in the multi-Line, multi-stage production setting, it is very important to determine the number of kanbans in deterministic kanban system under consideration with relevant factors as well as with cost. In concrete, we discuss about following factors in kanban system and provide a model formulating the multi-objective goal programming : Demand, stock on hand in process, Inventory cost and Labor cost, Vendor's suppling capacity, Work Load. Finally we analyze several numerical examples in order to test the model and attempt to expand the model in general case.

  • PDF

Time-Predictable Java Dynamic Compilation on Multicore Processors

  • Sun, Yu;Zhang, Wei
    • Journal of Computing Science and Engineering
    • /
    • v.6 no.1
    • /
    • pp.26-38
    • /
    • 2012
  • Java has been increasingly used in programming for real-time systems. However, some of Java's features such as automatic memory management and dynamic compilation are harmful to time predictability. If these problems are not solved properly then it can fundamentally limit the usage of Java for real-time systems, especially for hard real-time systems that require very high time predictability. In this paper, we propose to exploit multicore computing in order to reduce the timing unpredictability that is caused by dynamic compilation and adaptive optimization. Our goal is to retain high performance comparable to that of traditional dynamic compilation, while at the same time, obtain better time predictability for Java virtual machine (JVM). We have studied pre-compilation techniques to utilize another core more efficiently, preoptimization on another core (PoAC) scheme to replace the adaptive optimization system (AOS) in Jikes JVM and the counter based optimization (CBO). Our evaluation reveals that the proposed approaches are able to attain high performance while greatly reducing the variation of the execution time for Java applications.

Development and Application of System States for the Preemptive Goal Programming (우선순위 목적 프로그래밍을 위한 저수지운영율 개발 및 적용)

  • Cheong, Tae-Sung;Kang, Shin-Uk;Hwang, Man-Ha;Ko, Ick-Hwan
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2007.05a
    • /
    • pp.2049-2053
    • /
    • 2007
  • KModSim은 수자원배분에 관련된 물리적, 수문학적, 제도적, 그리고 행정적인 요구들을 동시에 만족하도록 디자인된 범용 우선순위 목적 선형최적화 모형으로써 자연유3tt입량과 기득 수리권 혹은 기득 저류권 등과 같은 다양한 형태의 저수권 사이의 조화운영이 가능하다. KModSim은 목적함수에 관련된 제약조건의 유연한 설정과 변경이 가능하며, 기존의 최적화 방법과 다르게 유역통합모의에 관련한 모형변수가 모형내에서 자동적으로 생성되도록 프로그램화 되어있다. 본 연구에서는 금강유역내 수자원의 효율적인 운영을 위하여 과거운영자료를 토대로 저수지운영율을 개발하고 시스템단계(system states)를 이용하여 KModSim 네트워크에 운영율을 적용하였다. 금강유역에서 개발한 운영율을 적용하고 모의한 결과 개발된 운영율은 실제저류량을 잘 재현하는 것으로 나타났다. 본 연구에서 개발된 운영율 및 시스템단계 방법은 다중목적 우선순위 선형최적화 모형을 이용하여 유역의 다양한 수자원운영모의에 사용될 수 있을 것으로 기대된다.

  • PDF

Preemptive Goal Programming Based Heuristic Methods for Reentrant Flow Shop Planning with Bi-Objective (재방문이 있는 흐름공정의 이종목적 계획을 위한 우선순위 목표계획법 기반의 휴리스틱 방법)

  • Cho, Hang-Min;Jeong, In-Jae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.3
    • /
    • pp.240-246
    • /
    • 2012
  • 논문은 병렬 설비로 이루어진 다수의 단계를 포함하는 재방문이 있는 혼합흐름공정의 계획 문제를 다룬다. 재방문작업에서 제품은 몇몇 공정을 여러 번 방문하게 되고 이로 인하여 재공의 혼잡과 장비의 유휴의 원인이 된다. 이 상황에서는 생산성과 고객 만족도를 향상 시키는 것이 중요한 이슈이다. 따라서 본 논문은 혼합흐름공정에서 스루풋을 최대화하고 지연된 고객 수요를 최소화하기 위해 우선순위 목표계획법 기반의 휴리스틱 방법들을 제안한다. 그리고 이 휴리스틱 방법은 이전 문헌에서 제시된 방법과 비교하여 성능을 비교하였다.

A Selection Method for Capital Budgeting Projects with Quality Function Deployment (품질기능전개를 이용한 자본투자프로젝트 선정방법)

  • 우태희
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2000.11a
    • /
    • pp.81-85
    • /
    • 2000
  • The purpose of this paper is to describe a new analytic method of capital budgeting projects that takes into account both customer wants and competitor's status and to give decision makers a tool for goal setting and planning for technology. This model, which is based on quality function deployment(QFD), has used the analytic hierarchy process(AHP) to determine the intensity of the relationship between the variables involved in each matrix of the model and the 0-1 integer programming to determine the allocation of funds to various technological projects. This paper also proposes how to calculate the new weight of columns to consider various strength levels of roof matrix, representing the correlation among the quality characteristics, using Lymsn's normalization procedure. To compare this model with Partovi's model, 1 adapt the same example which is suggested by Partovi and I show that the value of object function, has maximization problem, in this model is larger than that in Partovi's model.

  • PDF

Research on Transportation Planning System (Transportation Planning System에 대한 연구)

  • Jeong, Jae-Hun;Lee, Sang-Min;Min, Dae-Gi;Lee, Jae-Ho;Jim, Chen
    • 한국IT서비스학회:학술대회논문집
    • /
    • 2003.05a
    • /
    • pp.215-221
    • /
    • 2003
  • In today's rapidly changing business environment, quality of responsiveness to customer requirements for short order cycles and on time delivery is becoming more important and considered as one of critical success factors in supply chain management. Yet despite its importance on reducing transportation cost and improving customer service, little attention has been given to the transportation planning system in Korea SI industry. In this paper, we present development of transportation planning system especially to deal with vehicle routing problem which has the goal to minimize the costs of daily transportation operation and to maximize customer delivery service. The system architecture with other enterprise application is presented and real-world constraints are well incorporated into the system by combining constraints programming and meta heuristics.

  • PDF