• Title/Summary/Keyword: Assignment System

Search Result 866, Processing Time 0.024 seconds

A study on the productivity effects of transport vehicle by pooling system at container terminals (이송장비의 Pooling 운행방식에 따른 터미널하역생산성 효과)

  • Ha, Tae-Young;Shin, Jae-Yeong;Choi, Yong-Seok
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.29 no.1
    • /
    • pp.377-382
    • /
    • 2005
  • This paper deals with productivity improvement of stevedoring system by pooling opertaions of transport vehicle at automated container terminal. Usually, in traditional container terminals, grouping operations of transport vehicle are applied for container crane because vehicle routing path is simple and vehicle assignment is easy. But this static assignment(SA) operation that arrsign vehicles to container crane ar apron reduces flexibility of vehicles. Therefore, This paper presented 4 dynamic assignment(DA) method to improve efficiency of vehicles. These 4 dynamic assignment method consider present situations of container crane such as sequence(Se), queue time(Qt), productivity(Pr), numeric of vehicle assignment(Nv), numeric of buffer(Nb) at vehicles assignment. At the results, dynamic assignment operation to consider Qt, Nv, Nb is most efficient and by next time, dynamic assignment operation to consider Se is superior more than static assignment operation. but, dynamic assignment operation to consider Pr or Qt of container crane only is inefficient than static assignment operation.

  • PDF

A study on the spectrum assignment problem for a functional linear system (함수선형계의 스펙트럼지정문제에 관한 연구)

  • 이장우
    • 전기의세계
    • /
    • v.31 no.3
    • /
    • pp.209-217
    • /
    • 1982
  • This paper considers a finite spectrum assignment Problem for a functional retarded linear differential system with delays in control only. In this problem, by generalizing from an abstract linear system characterized by Semigroups on a Hilbert space to a finite dimensional linear system, we unify the relationship between a control-delayed system and its non-delayed system, and then by using the spectrum of the generator-decomposition of Semigroup, we try to get a feedback law which yields a finite spectrum of the closed-loop system, located at an arbitrarily preassigned sets of n points in the complex plane. The comparative examinations between the standard spectrum assignment method and the method of spectral projection for the feedback law which consists of proportional and finite interval terms over present and past values of control variables are also considered. The analysis is carry down to the elementary spectral projection level because, in spite of all the research efforts, so far there has been no significant attempt to obtain the feedback implementation directly from the abstract representation forms in the case of multivariables.

  • PDF

A Linear Approximation Model for an Asset-based Weapon Target Assignment Problem (자산기반 무기할당 문제의 선형 근사 모형)

  • Jang, Jun-Gun;Kim, Kyeongtaek;Choi, Bong-Wan;Suh, Jae Joon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.3
    • /
    • pp.108-116
    • /
    • 2015
  • A missile defense system is composed of radars detecting incoming missiles aiming at defense assets, command control units making the decisions on weapon target assignment, and artillery batteries firing of defensive weapons to the incoming missiles. Although, the technology behind the development of radars and weapons is very important, effective assignment of the weapons against missile threats is much more crucial. When incoming missile targets toward valuable assets in the defense area are detected, the asset-based weapon target assignment model addresses the issue of weapon assignment to these missiles so as to maximize the total value of surviving assets threatened by them. In this paper, we present a model for an asset-based weapon assignment problem with shoot-look-shoot engagement policy and fixed set-up time between each anti-missile launch from each defense unit. Then, we show detailed linear approximation process for nonlinear portions of the model and propose final linear approximation model. After that, the proposed model is applied to several ballistic missile defense scenarios. In each defense scenario, the number of incoming missiles, the speed and the position of each missile, the number of defense artillery battery, the number of anti-missile in each artillery battery, single shot kill probability of each weapon to each target, value of assets, the air defense coverage are given. After running lpSolveAPI package of R language with the given data in each scenario in a personal computer, we summarize its weapon target assignment results specified with launch order time for each artillery battery. We also show computer processing time to get the result for each scenario.

Predicting Due Dates under Various Combinations of Scheduling Rules in a Wafer Fabrication Factory

  • Sha, D.Y.;Storch, Richard;Liu, Cheng-Hsiang
    • Industrial Engineering and Management Systems
    • /
    • v.2 no.1
    • /
    • pp.9-27
    • /
    • 2003
  • In a wafer fabrication factory, the completion time of an order is affected by many factors related to the specifics of the order and the status of the system, so is difficult to predict precisely. The level of influence of each factor on the order completion time may also depend on the production system characteristics, such as the rules for releasing and dispatching. This paper presents a method to identify those factors that significantly impact upon the order completion time under various combinations of scheduling rules. Computer simulations and statistical analyses were used to develop effective due date assignment models for improving the due date related performances. The first step of this research was to select the releasing and dispatching rules from those that were cited so frequently in related wafer fabrication factory researches. Simulation and statistical analyses were combined to identify the critical factors for predicting order completion time under various combinations of scheduling rules. In each combination of scheduling rules, two efficient due date assignment models were established by using the regression method for accurately predicting the order due date. Two due date assignment models, called the significant factor prediction model (SFM) and the key factor prediction model (KFM), are proposed to empirically compare the due date assignment rules widely used in practice. The simulation results indicate that SFM and KFM are superior to the other due date assignment rules. The releasing rule, dispatching rule and due date assignment rule have significant impacts on the due date related performances, with larger improvements coming from due date assignment and dispatching rules than from releasing rules.

Optimum Allocation of Port Labor Gangs (I) In the case of single ship (항만하역노동력의 최적배분에 관한 연구 (I) 단일선박의 경우)

  • 이철영;우병구
    • Journal of the Korean Institute of Navigation
    • /
    • v.13 no.1
    • /
    • pp.55-61
    • /
    • 1989
  • Nowadays much efforts for evaluating the productivity of port physical distribution system to meet the rapid change of the port and shipping circumstances has been made continuously all over the world. The major part of these efforts is the improvement of the productivity of cargo handling system. The cargo equipment system as infrastructure in the cargo handling system is organized well in some degrees, but the management system of manpower as upper structure is still remained in an insufficient degree. There is little study, so far, on a systematic research for the management of port labor gang, and even those were mainly depended on rule of thumb. The object of this study is to introduce the method of optimal allocation and assignment for the labor gang in single ship, which was suggested as a first stage in dealing with them generally. The problem of optimal allocation and assignment of the labor gang can be (I) formalized with multi-stage allocation and assignment of the labor gang can be. (II) dealt with two stages in form of hierarchic structure and moreover, (III) The optimal size of labor gang was obtained through dynamic programming from the point of minimizing the summation of labor gang in every stage, (IV) For the problem of optimal assignment, the optimal policy was determined at the point of minimizing the summation of movement between hatches.

  • PDF

Robust pole assignment of proportional integral control system

  • Kim, Hwan-Seong;Ogasawara, Kenichi;Kawaji, Shigeyasu
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.373-378
    • /
    • 1994
  • This paper is concerned with assess the possibility of robust pole assignment of proportional integral(PI) state feedback control system. First, the equivalence relations between a PI control system and an argumented control system proposed by Kawaji and Kim(1994) are extended from the new points of views of invariant closed loop poles. Second, on the relations, a remarkable result that the integral gain of PI control system is directly related to the insensitivity of system is presented. And, it is shown that the design of robust PI pole assignment is possible under the certain conditions.

  • PDF

A Study on the Suspension System Modeling and Left Eigenstructure Assignment Control Design for Performance Improvement of an Automotive Suspension System (차량 현가시스템 성능 향상을 위한 현가장치 모델링 및 고유구조 지정 제어기 설계 연구)

  • Kim, Joo-Ho;Seo, Young-Bong;Choi, Jae-Weon;Yoo, Wan-Suk
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.11
    • /
    • pp.81-88
    • /
    • 1999
  • A conventional quarter-car suspension system is a single input system with one actuator. Thus, the performance enhancement for ride quality could be limited. In this paper, we propose a novel automotive suspension system for a quarter-car with two independent actuators to improve the control performance. The left eigenstructure assignment method for multi-variable systems has been applied to the proposed novel quarter-car model.

  • PDF

Development of the Reliability Traffic Assignment Model based on the Travel Time Variation (통행시간변화를 고려하는 신뢰도통행배정모형 개발)

  • 문병섭;이승재;임강원
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.5
    • /
    • pp.69-78
    • /
    • 1999
  • This paper defines the reliable based route choice Principle and formulates the reliability based equilibrium traffic assignment using the Principle. The reliability is defined as the difference of travel demand and capacity using the interference theory of the system engineering. An efficient solution a1gorithm based on Frank-Wo1fe algolithm is Presented to calculate and compare the reliability based traffic assignment with conventional travel time based assignment using small and large scaled road networks. The results show that reliability based traffic assignment converges to equilibrium solution in a reasonable computing time. The equilibrium link flows between reliability and travel time based traffic assignment differ each other in the sense that reliability based assignment is assigned based on the maximum difference of travel demand and link capacity whilst travel time based is assigned on the shortest travel time.

  • PDF

Capacity Improvement with Dynamic Channel Assignment and Reuse Partitioning in Cellular Systems

  • Chen Steven Li;Chong Peter Han Joo
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.13-20
    • /
    • 2006
  • In cellular mobile communications, how to achieve optimum system capacity with limited frequency spectrum is one of the main research issues. Many dynamic channel assignment (DCA) schemes have been proposed and studied to allocate the channels more efficiently, thus, the capacity of cellular systems is improved. Reuse partitioning (RP) is another technique to achieve higher capacity by reducing the overall reuse distance. In this paper, we present a network-based DCA scheme with the implementation of RP technique, namely dynamic reuse partitioning with interference information (DRP-WI). The scheme aims to minimize the effect of assigned channels on the availability of channels for use in the interfering cells and to reduce their overall reuse distances. The performance of DRP-WI is measured in terms of blocking probability and system capacity. Simulation results have confirmed the effectiveness of DRP-WI scheme. Under both uniform and non-uniform traffic distributions, DRP-WI exhibits outstanding performance in improving the system capacity. It can provide about 100% capacity improvement as compared to conventional fixed channel assignment scheme with 70 system channels.

Design and Implementation of e-Learn ing System with Dynamic Learn ing Contents Provision and Real-Time Assignment Evaluation (동적인 학습 내용 구성과 실시간 과제물 평가 기능을 가진 e-Learning 시스템의 설계 및 구현)

  • Kim Jung-Sook;Lee Hee-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.323-332
    • /
    • 2005
  • In this Paper, we design and implement an e-Learning system with dynamic learning contents Providing and re-time assignment system. The learner can select the dynamic learning contents Providing environments with test and Quiz Phase according to the learners' characters and interest to improve the learning effects. Also, we develop the real-time assignment system which is composed of multiple choice and essay test and can provide the interaction between teacher and learner immediately.

  • PDF