• 제목/요약/키워드: function assignment

검색결과 252건 처리시간 0.021초

납기를 고려한 FMS 일정계획에서의 기계선정규칙 (Next station selection rules for FMS scheduling against due-date)

  • 문일경;김태우
    • 경영과학
    • /
    • 제13권2호
    • /
    • pp.147-161
    • /
    • 1996
  • Due-date is an important factor in Flexible Manufacturing System scheduling. Even though most of researchers have focused part selection and loading problem using fixed due-date assignment rules, FMSs consist of multi-function machines which facilitate alternative processes. This research investigates interactions of three dispatching mechanisms, three NSS (Next Station Selection) rules and four due-date assignment rules using simulation. Both cost-based and time-based performance measures are considered in this research.

  • PDF

단위비행체계의 승무원 일일 비행스케줄링에 관한 연구 (A Study on the Daily Squadron Crew Scheduling)

  • 이유인
    • 한국국방경영분석학회지
    • /
    • 제15권1호
    • /
    • pp.28-43
    • /
    • 1989
  • Squadron crew scheduling problems can be defined as the assignment of crews to flights consistent with safety regulations and squadron policy. In this paper, the daily crew scheduling problems are formulated as zero-one interger programs known as generalized assignment problems. The objective function is to maximize the weighted mission interval to improve the crew performance. Flight schedules using the 0-1 integer model are compared with manual schedules. The results of the study show that the average crew performance is improved.

  • PDF

엔드밀링 공정에서 극점배치 구속적응제어 시스템 (A Pole-Assignment ACC System in the Peripheral End Milling Process)

  • 정성종
    • 한국생산제조학회지
    • /
    • 제5권2호
    • /
    • pp.63-72
    • /
    • 1996
  • In order to regulate the cutting force at a desired level during peripheral end milling processes a feedrate override Adaptive Control Constraint (ACC) system was developed. The feedrate override function was accomplished through a development of programmable machine controller (PMC) interface technique on the NC controller, Nonlinear model of the cutting process was linearized as an adaptive model with a time varying process parameter. An integral type estimator was introduced for on-line estimation of the cutting process parameter, Zero order hold digital control methodology which uses pole-assignment concept for tuning of PI controllers was applied for the ACC system. Performance of the ACC system wsa confirmed on the vertical machining center equipped with fanuc OMC through a large amount of experiment.

  • PDF

무선통신 네트워크에서 동적채널할당을 위한 진화프로그램의 개발 (Development of Evolution Program for Dynamic Channel Assignment in Wireless Telecommunication Network)

  • 김성수;한광진;이종현
    • 산업공학
    • /
    • 제14권3호
    • /
    • pp.227-235
    • /
    • 2001
  • There is a rapidly growing demand for wireless telecommunication. However, the number of usable channel is very limited. Therefore, the problem of channel assignment becomes more and more important to use channels as efficiently as possible. The objective of this paper is to develop an evolution program (EP) to find an efficient dynamic channel assignment method for minimum interference among the channels within reasonable time. The series of specific channel number is used as a representation of chromosome. The only changed chromosomes by crossover and mutation are evaluated in each generation to save computation time and memory for the progress of improved EP. We can easily differentiate the fitness value of each chromosome using proposed evaluation function. We also control the weighting factor of the mutation rate and the used number of elitist chromosomes for the speed of convergence to the optimal solution.

  • PDF

안정동력학에 의한 가변수요 통행배정모형 (A Variable Demand Traffic Assignment Model Based on Stable Dynamics)

  • 박구현
    • 한국경영과학회지
    • /
    • 제34권1호
    • /
    • pp.61-83
    • /
    • 2009
  • This study developed a variable demand traffic assignment model by stable dynamics. Stable dynamics, suggested by Nesterov and do Palma[19], is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with the user equilibrium model, which is based on the arc travel time function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on congestion. It is therefore expected to be a useful analysis tool for transportation planners. In this study, we generalize the stable dynamics into the model with variable demands. We suggest a three stage optimization model. In the first stage, we introduce critical travel times and dummy links and determine variable demands and link flows by applying an optimization problem to an extended network with the dummy links. Then we determine link travel times and path flows in the following stages. We present a numerical example of the application of the model to a given network.

확정적 주기시간을 갖는 다기종 Line설비의 최적담당 기계대수 결정 (Optimal Man-machine Assignment for Sequential Dependent Multi Different Machines Under Deterministic Cycle Time)

  • 이근희;김홍국
    • 산업경영시스템학회지
    • /
    • 제11권17호
    • /
    • pp.39-46
    • /
    • 1988
  • This Paper is concerned with a man-multi machine assignment problem to minimize idle time. Assuming different types of semi-automatic machines with deterministic service-processing time, the problem approaches by sequential dependent one operator can handle several machines, where determine optimal range the cost of idle labor and machine time is to be minimized in preparing a work schedule. The Procedure, to establish man-machine assignment model, and it's results are: (1) Objective function to minimize opportunity loss cost, which is happened by idle time, is verified recursive process through heuristic method. (2) The algorithm, is programmed by BASIC language for personal computer, and a numerical example is given to illustrate the heuristic algorithm. This study will be helpful to enhance productivity of Shopflooras a result of increasing the efficiencies of both operator and machine.

  • PDF

Combined Traffic Signal Control and Traffic Assignment : Algorithms, Implementation and Numerical Results

  • Lee, Chung-Won
    • 대한교통학회:학술대회논문집
    • /
    • 대한교통학회 2000년도 제37회 학술발표회논문집
    • /
    • pp.89-115
    • /
    • 2000
  • Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperform the iterative search and (2) in the large network, vice versa.

  • PDF

Routing Algorithm with Adaptive Weight Function based on Possible Available Wavelength in Optical WDM Networks

  • Pavarangkoon, Praphan;Thipchaksurat, Sakchai;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.1338-1341
    • /
    • 2004
  • In this paper, we have proposed a new approach of routing and wavelength assignment algorithms, called Possible Available Wavelength (PAW) algorithm. The weight of a link is used as the main factor for routing decision in PAW algorithm. The weight of a link is defined as a function of hop count and available wavelengths. This function includes a determination factor of the number of wavelengths that are being used currently and are supposed to be available after a certain time. The session requests from users will be routed on the links that has the greatest number of link weight by using Dijkstra's shortest path algorithm. This means that the selected lightpath will has the least hop count and the greatest number of possible available wavelengths. The impact of proposed link weight computing function on the blocking probability and link utilization is investigated by means of computer simulation and comparing with the traditional mechanism. The results show that the proposed PAW algorithm can achieve the better performance in terms of the blocking probability and link utilization.

  • PDF

Cell Transmission 이론을 이용한 동적통행배정기법 개발에 관한 연구 (The Development of A Dynamic Traffic Assignment Technique using the Cell Transmission Theory)

  • 김주영;이승재;손의영
    • 대한교통학회지
    • /
    • 제17권4호
    • /
    • pp.71-84
    • /
    • 1999
  • 본 연구의 목적은 기존 동적통행배정모형의 접근 기법과는 달리 교통류이론을 이용하여 동적분석모형을 구축하고, 이 모형에 적합한 동적통행배정기법을 개발하는 것이다. 본 연구에서는 기존 동적교통류 모델 중 동적통행배정에 가장 적합하다고 판단되는 Daganzo의 cell transmission theory를 이용하여 동적분석모형을 구축하였으며, 동적통행배정기법인 분류부분할모델, 비용갱신모듈, 링크비용함수모듈을 새롭게 개발하였다. 또한 Daganzo가 명확하게 제시하지 않은 최대대기시간 결정 알고리듬을 제시하였다. 본 연구에서 구축한 모형을 가상의 네트워크에 적용한 결과 병목구간분석, HOV타로 효과분석등은 교통특성을 현실적으로 반영하고 있다. 통행배정결과는 수학적 기법을 적용한 동적통행배정모형과 같이 완전한 균형(equibriun)상태의 해를 보여주지 못하지만, 노선별 평균통행시간이 시간대별로 비슷하게 유지해나가는 결과를 보이고 있다. 본 모형은 고속도로 합류부 및 분류부의 교통특성분석, HOV 효과분석, TCS 및 램프미터링과 접목하여 고속도로 운영에 이용될 수 있으리라 판단된다.

  • PDF