• 대한산업공학회지
• /
• 제27권2호
• /
• pp.140-149
• /
• 2001

The paper discusses the problem of finding the Origin-Destination(O-D) shortest paths in internodal transportation networks with time-schedule constraints. The shortest path problem on the internodal transportation network is concerned with finding a path with minimum distance, time, or cost from an origin to a destination using all possible transportation modalities. The time-schedule constraint requires that the departure time to travel from a transfer station to another node takes place only at one of pre-specified departure times. The scheduled departure times at the transfer station are the times when the passengers are allowed to leave the station to another node using the relative transportation modality. Therefore, the total time of a path in an internodal transportation network subject to time-schedule constraints includes traveling time and transfer waiting time. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. The effectiveness of the GA approach is evaluated using several test problems.

• 인터넷정보학회논문지
• /
• 제8권4호
• /
• pp.105-117
• /
• 2007

프로젝트 관리자는 입찰 또는 개발을 성공하기 위해 비용과 일정을 프로젝트 초기 단계에서 보다 정확히 추정해야만 한다. 평균적으로 대부분의 프로젝트들이 수행하고 있는 명목상의 개발기간은 경험법칙, 선형함수 추정경험 또는 개략적 일정 추정표로부터 유도할 수 있다. 명목상 개발기간에는 다양한 경험법칙이 존재하며, 선형함수 모델은 충분한 정보를 제공하지 못하여 특정 규모의 프로젝트에 적합한 개발노력과 일정을 결정하기 어렵다. 본 논문은 개략적 일정 추정표로부터 개발노력과 일정을 유도하는 통계적 회귀분석 모델을 제시하였다. 먼저, 개략적 일정 추정표에서 제시하고 있는 최대 단축기간, 효율적 개발기간과 명목상 개발기간을 재정의 하였다. 다음으로 개발노력과 기간과의 관계를 고찰하고, 개략적 일정추정표에 제시되지 않은 특정 규모의 소프트웨어에 대한 개발노력 추정 모델과 개발노력에 따른 일정을 보다 정확히 추정할 수 있는 모델을 제시하였다. 제시된 회귀분석 모델은 기존의 방법들과 비교하여 상대오차를 최대 2%까지 줄이는 효과를 얻었다. 또한, 특정 규모의 소프트웨어에 대해서도 개발노력과 일정을 추정할 수 있었다.

• 대한산업공학회지
• /
• 제14권1호
• /
• pp.73-82
• /
• 1988

This research is concerned with production scheduling for FMS (Flexible Manufacturing System) which consists of machine centers served by cycle conveyor. The objective of the research is to develop and evaluate scheduling procedures to minimize the mean flow time. An optimal algorithm called SCTF (Shortest Circle Time First) is proposed when the conveyor runs at minimum possible speed (CS=1) and a heuristic algorithm called SCTJMF (Shortest Cycle Time and Job Matching Algorithm) is suggested when the conveyor runs at double speed (CS=2). The evaluation of the heuristic algorithm was implemented by comparison with the optimal algorithm for 112 experimentations for CS=1 and random schedule. The results showed that the proposed heuristic algorithm provides better solution that can be regarded noticeable when compared with SCTF algorithm and random scheduling.

• 한국임상수의학회지
• /
• 제34권4호
• /
• pp.245-248
• /
• 2017

Modified rush ASIT protocol has been performed to identify the ideal schedule that allows the dose considered effective to be reached in the shortest possible time with the fewest adverse effects. Ten atopic dogs of this study includes fulfillment of Favrot's criteria. Offending allergens were identified by the use of IDST. During the induction period, the dogs were received a total of 15 injections. Ten injections were administrated every 30 minutes in a day with gradually increasing amounts and concentrations of allergens, and the last 5 injections were administered every 3 days. Disease severity was quantified by using the canine atopic dermatitis extent and severity index (CADESI). During induction period, reduction rate from baseline scores varied between 1% and 67% and the improvement of ${\geq}50%$ was recorded after induction period of therapy for CADESI-03 score in 6 of the 10 dogs. This study of ten dogs with atopic dermatitis provide evidence for the efficacy and safety of modified rush ASIT for clinical improvement.