• Advances in aircraft and spacecraft science
• /
• 제9권4호
• /
• pp.335-347
• /
• 2022

Airport operations are well-known as a bottleneck in the air traffic system, putting growing pressure on the world's busiest airports to schedule arrivals and departures as efficiently as possible. Effective planning and control are essential for increasing airport efficiency and reducing aircraft delays. Many algorithms for controlling the arrival/departure queuing area are handled, considering it as first in first out queues, where any available aircraft can take off regardless of its relative sequence with other aircraft. In the suggested system, this problem was compared to the problem of scheduling n tasks (plane takeoffs and landings) on a multiple machine (runways). The proposed technique decreases delays (via efficient runway allocation or allowing aircraft to be expedited to reach a scheduled time) to enhance runway capacity and decrease delays. The aircraft scheduling problem entails arranging aircraft on available runways and scheduling their landings and departures while considering any operational constraints. The topic of this work is the scheduling of aircraft landings and takeoffs on multiple runways. Each aircraft's takeoff and landing schedules have time windows, as well as minimum separation intervals between landings and takeoffs. We present and evaluate a variety of comprehensive concepts and solutions for scheduling aircraft arrival and departure times, intending to reduce delays relative to scheduled times. When compared to First Come First Serve scheduling algorithm, the suggested strategy is usually successful in reducing the average waiting time and average tardiness while optimizing runway use.

• 한국정보통신학회논문지
• /
• 제26권10호
• /
• pp.1432-1440
• /
• 2022

최근 VDI(Virtual Desktop Infrastructure)가 오피스 업무 환경뿐만 아니라 고사양의 멀티코어 기반 어플리케이션을 사용하는 워크로드에도 많이 사용되면서 VDI에 대한 실시간성과 안정성에 대한 요구 사항이 증대되고 있다. 그에 따라 VDI에서 원격접속에 사용되는 디스플레이 프로토콜과 가상머신의 성능 최적화 또한 중요성이 높아졌다. 본 논문에서는 멀티코어 기반 어플리케이션 운용을 위한 데스크탑 가상화 구성을 위해 두 가지를 제안한다. 첫 번째는 멀티 프로세싱으로 인한 고부하 상황에서 최적의 성능을 가진 디스플레이 프로토콜의 코덱 구성을 제안한다. 두 번째는 가상머신 간 CPU 경합 시 스케쥴링 지연을 줄이기 위한 가상 CPU 스케쥴링 최적화 방안을 제안한다. 시험 결과 Blast Extreme의 H.264 코덱이 가장 좋고 안정적인 프레임을 보여줬으며 스케쥴링 최적화를 통해 가상 CPU의 스케쥴링 성능이 개선됨을 확인하였다.

• 대한토목학회논문집
• /
• 제28권5D호
• /
• pp.587-595
• /
• 2008

1960년대부터 최근까지 버스 이용자들의 편의를 증진시키며 버스운영 측면에서 불필요한 운행을 최소화하기 위한 버스운행계획 최적화에 대한 많은 연구가 진행되어 왔다. 2000년 이후 ITS의 일환으로 버스 운행계획 최적화를 통한 운행관리와 정보제공 측면에서 그 중요성이 대두됨에 따라 과학적인 기반 하에 합리적인 버스운행계획 수립을 위한 연구가 더욱 활발히 진행되고 있는 추세이다. 본 연구에서는 버스운행계획 수립을 위해 구간 및 정류소 단위의 운행이력, 버스이용수요 등 세부자료를 활용하여 DTR 및 DTRC 모형에 따라 버스운행계획을 수립하였고 기점 및 정류소 단위의 timetable을 작성하였다. 모형 검증을 위해 서울시 472번 간선노선을 대상으로 BMS, 교통카드 등의 수집 자료를 활용하여 운행계획을 수립하고, 모형에 사용된 파라미터와 가정들에 대한 신뢰성 확보를 위하여 민감도 분석을 수행하였다.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2002년도 추계학술대회 논문집
• /
• pp.135-140
• /
• 2002

Studies on the optimization of machining process can be divided into two different approaches: off-line feedrate scheduling and adaptive control. Each approach possesses its respective strong and weak points compared to each other. That is, each system can be complementary to the other. In this regard, a combined system, which is a feedrate control system for cutting force optimization, was proposed in this paper to make the best of each approach. Experimental results show that the proposed system could overcome the weak points of two systems.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 1994년도 춘계학술발표회
• /
• pp.29-42
• /
• 1994

• 한국경영과학회지
• /
• 제41권2호
• /
• pp.129-139
• /
• 2016

This paper presented a robust ship scheduling model using the quadratic programming problem. Given a set of available carriers under control and a set of cargoes to be transported from origin to destination, a robust ship scheduling that can minimize the mean-variance objective function with the required level of profit can be modeled. Computational experiments concerning relevant maritime transportation problems are performed on randomly generated configurations of tanker scheduling in bulk trade. In the first stage, the optimal transportation problem to achieve maximum revenue is solved through the traditional set-packing model that includes all feasible schedules for each carrier. In the second stage, the robust ship scheduling problem is formulated as mentioned in the quadratic programming. Single index model is used to efficiently calculate the variance-covariance matrix of objective function. Significant results are reported to validate that the proposed model can be utilized in the decision problem of ship scheduling after considering robustness and the required level of profit.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 1996년도 The Korean Institute of Navigation 1996년도 춘계학술발표회 논문집
• /
• pp.59-76
• /
• 1996

Vessels in the world merchant fleet generally operate in either liner or bulk trade. The supply and the demand trend of general cargo ship are both on the ebb however those trend of tankers and containers are ins light ascension. Oil tankers are so far the largest single vessel type in the world fleet and the tanker market is often cited as a texbook example of perfect competition. Some shipping statistics in recent years show that there has been a radical fluctuation in spot charter rate under easy charter's market. This implies that the proper scheduling of tankers under spot market fluctuation has the great potential of improving the owner's profit and economic performance of shipping. This paper aims at developing the TS-DSS(Decision Support System for Tanker Scheduling) in the context of the importance of scheduling decisions. TS-DSS is defined as a DSS based on the optimization models for tanker scheduling. The system has been developed through the life cycle of systems analysis design and implementation to be user-friendly system. The performance of the system has been tested and examined by using the data edited under several tanker scheduling has been tested and examined by using the data edited under several tanker scheduling scenarios and thereby the effectiveness of TS-DSS is validated satisfactorily. The authors conclude the paper with the comments of the need of appropriate support environment such as data-based DSS and network system for successful implementatio of the TS-DSS.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 1999년도 추계학술대회 논문집
• /
• pp.46-53
• /
• 1999

As of July 1999, i,185 lomocotives(excluding metropolitan area electric locomotives) are in Korean National Railroad(KNR). With this limited number of resources assigning locomotives to each trains of timetable is very important in the entire railway management point of view because schedule can be regarded as goods in transportation industry. On a simple rail network, it is rather easier to assign proper locomotives to trains with the experience of operating experts and get optimal assignment solution. However, as the network is getting bigger and complicated, the number of trains and corresponding locomotives will be dramatically increased to rover all the demands required to service all of the trains in timetable. There will be also numerous operational constraints to be considered. Assigning proper locomotives to trains and building optimal cyclic rotations of locomotive routings will result in increasing efficiency of schedule and giving a guarantee of more profit. The purpose of this study is two fold: (1) we consider a planning-level locomotive scheduling problem with the objective of minimizing the wasting cost under various practical constraints and (2) development of implementation prototype program of its assigning result. Not like other countries, i.e. Canada, Sweden, Korean railroad operates on n daily schedule basis. The objective is to find optimal assignment of locomotives of different types to each trains, which minimize the wasting cost. This problem is defined on a planning stage and therefore, does not consider operational constraints such as maintenance and emergency cases. Due to the large scale of the problem size and complexity, we approach with heuristic methods and column generation to find optimal solution. The locomotive scheduling prototype consists of several modules including database, optimization engine and diagram generator. The optimization engine solves MIP model and provides an optimal locomotive schedule using specified optimization algorithms. A cyclic locomotive route diagram can be generated using this optimal schedule through the diagram generator.

• 대한기계학회논문집A
• /
• 제24권8호
• /
• pp.2131-2142
• /
• 2000

As recent production facilities are usually operated with unmanned material-handling system, the development of an efficient schedule with deadlock avoidance becomes a critical problem. Related researches on deadlock avoidance usually focus on real-time control of manufacturing system using deadlock avoidance policy. But little off-line optimization of deadlock-free schedule has been reported. This paper presents an optimization method for deadlock-free scheduling for Job-Shop system with no buffer. The deadlock-free schedule is acquired by the procedure that generates candidate lists of waiting operations, and applies a deadlock avoidance policy. To verify the proposed approach, simulation resultsare presented for minimizing makespan in three problem types. According to the simulation results the effect of each deadlock avoidance policy is dependent on the type of problem. When the proposed LOEM (Last Operation Exclusion Method) is employed, computing time for optimization as well as makespan is reduced.

• 산업경영시스템학회지
• /
• 제43권2호
• /
• pp.79-86
• /
• 2020

To make a satisfactory decision regarding project scheduling, a trade-off between the resource-related cost and project duration must be considered. A beneficial method for decision makers is to provide a number of alternative schedules of diverse project duration with minimum resource cost. In view of optimization, the alternative schedules are Pareto sets under multi-objective of project duration and resource cost. Assuming that resource cost is closely related to resource leveling, a heuristic algorithm for resource capacity reduction (HRCR) is developed in this study in order to generate the Pareto sets efficiently. The heuristic is based on the fact that resource leveling can be improved by systematically reducing the resource capacity. Once the reduced resource capacity is given, a schedule with minimum project duration can be obtained by solving a resource-constrained project scheduling problem. In HRCR, VNS (Variable Neighborhood Search) is implemented to solve the resource-constrained project scheduling problem. Extensive experiments to evaluate the HRCR performance are accomplished with standard benchmarking data sets, PSPLIB. Considering 5 resource leveling objective functions, it is shown that HRCR outperforms well-known multi-objective optimization algorithm, SPEA2 (Strength Pareto Evolutionary Algorithm-2), in generating dominant Pareto sets. The number of approximate Pareto optimal also can be extended by modifying weight parameter to reduce resource capacity in HRCR.