• Title/Summary/Keyword: scheduling method

Search Result 1,386, Processing Time 0.037 seconds

A Fuzzy Vehicle Scheduling Problem

  • Han, Sang-Su;Lee, Kyo-Won;Hiroaki Ishii
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.666-668
    • /
    • 1998
  • In this paper, we consider a bi-objective vehicle routing problem to minimize total distance traveled and maximize minimum integrated satisfaction level of selecting desirable routes in an fuzzy graph. The fuzzy graph reflects a real delivery situation in which there are a depot, some demand points, paths linking them, and distance and integrated satisfaction level are associated with each route. For solving the vi-objective problem we introduce a concept of routing vector and define non-dominated solution for comparing vectors. An efficient algorithm involving a selection method of non-dominated solutions based on DEA is proposed for the vehicle routing problem with rigid distance and integrated satisfaction level.

  • PDF

A Game Theoretic Cross-Layer Design for Resource Allocation in Heterogeneous OFDMA Networks

  • Zarakovitis, Charilaos C.;Nikolaros, Ilias G.;Ni, Qiang
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.1 no.1
    • /
    • pp.50-64
    • /
    • 2012
  • Quality of Service (QoS) and fairness considerations are undoubtedly essential parameters that need to be considered in the design of next generation scheduling algorithms. This work presents a novel game theoretic cross-layer design that offers optimal allocation of wireless resources to heterogeneous services in Orthogonal Frequency Division Multiple Access (OFDMA) networks. The method is based on the Axioms of the Symmetric Nash Bargaining Solution (S-NBS) concept used in cooperative game theory that provides Pareto optimality and symmetrically fair resource distribution. The proposed strategies are determined via convex optimization based on a new solution methodology and by the transformation of the subcarrier indexes by means of time-sharing. Simulation comparisons to relevant schemes in the literature show that the proposed design can be successfully employed to typify ideal resource allocation for next-generation broadband wireless systems by providing enhanced performance in terms of queuing delay, fairness provisions, QoS support, and power consumption, as well as a comparable total throughput.

  • PDF

Fast Hologram Generation Method Using Scheduling of Multi-GPGPUs (다중 GPGPU의 스케쥴링을 이용한 고속 홀로그램 생성 방법)

  • Lee, Yoon-Hyuk;Seo, Young-Ho;Kim, Dong-Wook
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2016.06a
    • /
    • pp.364-365
    • /
    • 2016
  • 컴퓨터 생성 홀로그램(CGH)는 방대한 계산 량을 가지고 있어, 고해상도의 홀로그램을 생성하기 위하여 고속 홀로그램 생성 방법이 필요하다. 본 논문에서는 다중 GPGPU의 스케쥴링 기법을 이용하여 고속화 하는 방법을 제안한다. 첫 번째로는 커널 내에서 공유 메모리를 이용한 스케쥴링 기법을 통하여 고속화를 하고, 두 번째로는 GPGPU간의 P2P(peer-to-peer)데이터 전송을 이용한 스케쥴링을 했다. nVidia의 GTX680 2개 GPGPU를 이용하여 기존의 방법보다 약 50%의 속도 향상을 확인하였다.

  • PDF

A High Speed Hologram Generation Method Using Scheduling of Multi-GPGPU and Multi-Processor (다중 프로세서와 다중 GPGPU의 스케줄링을 이용한 고속 홀로그램 생성 방법)

  • Lee, Yoon-Hyuk;Seo, Young-Ho;Kim, Dong-Wook
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2017.06a
    • /
    • pp.213-214
    • /
    • 2017
  • 홀로그램을 생성하기 위해서 많은 양의 계산을 필요하기 때문에 고속 홀로그램 생성 방법이 필요하다. 본 논문에서는 다중 프로세서와 다중 GPGPU의 스케줄링을 이용하여 고속화 하는 방법을 제안하고 구현하였다. 다중 프로세서를 이용하여 입력과 출력부분을 나누어 동기화 동작을 줄이고, 버퍼를 이용하여 커널과 커널 사이의 대기 시간을 줄일 수 있도록 스케줄링 하였다. nVidia사의 GTX680(Kepler구조) 2개를 이용하여 구현하였을 때, 이전 연구에서 제안한 방법에 비하여 약 70% 정도 계산시간을 줄일 수 있다.

  • PDF

A Study on the Prediction of Recycled Aggregate Concrete Strength Using Case-Based Reasoning and Artificial Neural Network (사례기반 추론과 인공신경망을 적용한 순환골재콘크리트 강도 추정에 관한 비교 연구)

  • Kim Dae-Won;Choi hee-Bok;Kang Kyung-In
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2005.05a
    • /
    • pp.119-124
    • /
    • 2005
  • It is necessary for prediction of recycled aggregate concrete(RAC) strength at the early stage that facilitate concrete form removal and scheduling for construction. However, to predict RAC strength is difficult because of being influenced by complicated many factors. Therefore, this research suggest optimized estimation method that can reflect many factors. One way is Case-Based Reasoning(CBR) that solved new problems by adapting solutions to similar problems solved in the past, which are solved in the case library. Other way is Artificial Neural Networks(ANN) that solved new problems by training using a set of data, which is representative of problem domain. This study is to propose comparing accuracy of the estimating the compressive strength of recycled aggregate concrete using Case-Based Reasoning(CBR) and Artificial Neural Networks(ANN).

  • PDF

Stochastic Programming Approach to Scheduling Elective Surgeries and the Effects of Newsvendor Ratio on Operating Room Utilization (추계적 계획법을 이용한 수술실 예약 모델과 Newsvendor 비율의 자원 효율성에 대한 영향 분석)

  • Min, Dai-Ki
    • Korean Management Science Review
    • /
    • v.28 no.2
    • /
    • pp.17-29
    • /
    • 2011
  • The purpose of this paper is to schedule elective surgery patients using a stochastic programming approach and to illustrate how operating room utilization behaves when a decision-maker varies costs associated with utilization. Because of the uncertainty in surgery durations, the underage and overage costs that a decision-maker considers plays an important role in allocating surgery cases into available operating room capacity. We formulate the problem as a stochastic mixed integer programming and propose a sampling-based approximation method for a computational purpose. Newsvendor model is employed to explain the results from numerical experiments that are conducted with the actual data from a hospital. The results show that the operating room utilization is more sensitive when the unit overtime cost is relatively larger than the unit cost for underutilized time.

Disassembly Scheduling with Multiple Product Types and Parts Commonality (공통 부품을 포함한 복수 제품들에 대한 분해 일정계획)

  • Kim, Hwa-Joong;Lee, Dong-Ho;Xirouchakis, Paul
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.421-424
    • /
    • 2004
  • This paper focuses on the problem of determining the quantity and timing of disassembling used products while satisfying the demand of their parts or components over a planning horizon. The case of multiple product types with parts commonality is considered for the objective of minimizing the sum of setup, disassembly operation, and inventory holding costs. A heuristic is suggested, in which an initial solution is obtained using a linear programming relaxation method, and then improved by perturbing the given solution using a dynamic programming approach and a look-ahead check while considering the trade-offs among different cost factors.

  • PDF

A Study on the Integrated System and Sensitivity Analysis for Line Capacity Calculation Model (선로용량 계산 모델의 통합과 통합 민감도 분석 체계에 관한 연구)

  • Kim, Mu-Ryong;Kim, Han-Sin;Lee, Chang-Ho;Kim, Bong-Seon;Kim, Dong-Hui;Hong, Sun-Heum
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2005.11a
    • /
    • pp.30-39
    • /
    • 2005
  • Line capacity calculation has been used to determine optimum efficiency and safe train service for train scheduling plan and investment priority order throughout detecting bottleneck section. Because of some problems of Yamagisi and UIC methods for line capacity calculation, developing of the method of line capacity calculation and evaluation for the Korea circumstance is important. This paper deals with the integrated system of TPS(Train Performance Simulator), PES(Parameter Evaluation Simulator), LCS (Line Capacity Simulator) and sensitivity analysis for line capacity calculation model.

  • PDF

The Way of Production Planning Using the Inventory Control Method, Responding the Demand Fluctuation (불안정한 주문 패턴의 수요에 대응하는 재고 관리 기법을 응용한 생산계획 수립 방법)

  • Bae, Byeong-Gan;Cho, Joong-Hyun;Kang, Kyung-Sik
    • Journal of the Korea Safety Management & Science
    • /
    • v.9 no.3
    • /
    • pp.119-125
    • /
    • 2007
  • As competition in manufacturing enterprise is contested, the scope of safely production planning, manufacturing enterprise should ensure, has been reduced. The more upstream of SCM, the more reduction of scope of production planning. As a result, order fluctuation is more sharply contested. Through improving the logistics network, it is best way that the end user's demand information is conveyed to upstream of SCM, but it is difficult in fact. In this paper, it mention the way of robustic adjustment, in the suppliers' point of view, the end user's demand information is dammed up, as they postpone responding the customer's order as a possible. And it will show the result of appling the way, as a case study.

Gain scheduling method for improving load transient characteristic (부하 변동 특성 개선을 위한 이득 조정 기법)

  • Cho, Je-Hyung;Park, Ki-Bum;Park, Jin-Sik;Moon, Gun-Woo;Youn, Myung-Joong
    • Proceedings of the KIPE Conference
    • /
    • 2011.07a
    • /
    • pp.388-389
    • /
    • 2011
  • 본 논문에서는 서버용 전원 장치의 DC-DC단에 사용되는 디지털 전압 모드 제어기를 설계한다. 서버용 전원 장치는 2차 측에 고전류가 흐르는 사양으로 인하여 부하 전류에 따라 출력 인덕턴스 변화를 가지게 되며, hold-up time 규제를 만족하기 위하여 입력 전압의 변동 범위를 가진다. 이와 같은 조건은 제어기를 설계하는데 제약을 작용하게 되어 고정 이득을 가지는 방식에서는 최적화된 부하 변동 특성을 얻기 힘들다. 이와 같은 문제점을 해결하기 위하여 제어기의 이득 조정 기법을 제안하고 실험을 통하여 검증한다.

  • PDF