• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.924-927
• /
• 2016

In this paper, we consider a cumulative distribution function (CDF)-based opportunistic scheduling for downlink transmission in a cellular network consisting of a base station and multiple mobile stations. We present a closed-form formula for the average starvation period of each mobile station (i.e., the length of the time interval between two successive scheduling points of a mobile station) over Markov time-varying channels. Based on our formula, we investigate the starvation period of the CDF-based scheduling for various system parameters.

• Korean Management Science Review
• /
• v.9 no.1
• /
• pp.119-137
• /
• 1992

A two phase heuristic algorithm has been developed for the resolution of resource conflicts in a single project scheduling problem. Phase 1 of the algorithm generates a feasible schedule by repairing resource conflicts. Phase 2 finds local improvements in the schedule found in phase 1. Then, the algorithm has been applied to multi project and job shop scheduling. Computational results are compared with those of dispatching procedures. Index Terms-disjunctive constraints, heuristic algorithm, project scheduling, job-shop scheduling.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.149-152
• /
• 2000

The chartered bus scheduling is to determine the allocation of buses to customer service requests. For the scheduling, we first represent the scheduling problem using a graph and develop a mathematical model. Second, we develop an algorithm for the scheduling problem including heuristic methods. We tested the performance of the algorithm on instances with real data. As a result, the total empty load driving time is reduced over 10% comparing with that of current practice at the company

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.472-474
• /
• 2004

본 논문은 그리드 환경에서 RPC 프로그래밍 메커니즘의 성능향상을 위하여 DAG기반의 Co-scheduling시스템의 구현에 관한 것이다. 제안된 Co-scheduling의 목적은 복수개의 관련된 RPC들의 데이터 입출력 관계를 고려하여 불필요하거나 중복되는 네트워크상의 데이터전송을 제거함으로써 실행시간을 줄이는 것이다. 사용자에 의해 만들어진 작업흐름을 DAG로 구성하여 각 작업에 대한 자원을 탈당 받아 실행기반 시스템을 통해 수행된다. 이 논문에서는 기존 RPC시스템에서의 오버헤드를 지적하고 그것을 극복하기 위한 DAG기반 Co-scheduling을 설명한다. 실험을 통해 구현된 시스템의 성능향상을 확인한다.

• International Journal of Quality Innovation
• /
• v.10 no.2
• /
• pp.19-27
• /
• 2009

This paper considers the short term fleet scheduling problem as described by Keskinocak and Tayur (1998). Fleet scheduling may directly affect the service quality of fractional jet aircraft business. The contributions of this paper are two: (i) we show how their model is easily implemented in a standard modeling language, LINGO, and (ii) an alternate formulation is given which is expected to perform better on large, difficult problems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.4
• /
• pp.248-254
• /
• 2010

In this paper, we survey the parallel machines scheduling problem with GoS eligibility constraints so as to minimize the makespan. Our survey covers off-line, online and semi-online scheduling problems. In the case of online scheduling, we only focus on online scheduling one by one. Hence we give an introduction to the problem and present important results of the problem.

• Proceedings of the Korean DIstribution Association Conference
• /
• 2003.02a
• /
• pp.109-120
• /
• 2003

As the logistics industrial environment becomes more complex and its scale becomes increase, the vehicle fleet scheduling system has become recognized the necessity as a major strategy in the logistics field. The vehicle fleet scheduling system is computerized package that find the vehicle routes and schedules to accomplish the required service to customers using vehicles. This paper introduces the state of the art of vehicle fleet scheduling system in Korea and foreign country and the future research subject are presented.

• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.408-409
• /
• 2006

In this paper, we surveyed researches on the generation maintenance scheduling in competitive electricity markets. Maintenance scheduling can be one of the strategies submitted by market participants in electricity market. Many researches on the maintenance scheduling were preceded with or without transmission system. They have their own specific algorithm for ISO to operate, and control the maintenance schedules. This paper is focused on the survey on the generator and transmission system maintenance scheduling in competitive electricity markets.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.9
• /
• pp.1088-1095
• /
• 1999

This paper presents short-term hydro scheduling method for hydrothermal coordination by genetic algorithms. Hydro scheduling problem has many constraints with fixed final reservoir volume. In this paper, the difficult water balance constraints caused by hydraulic coupling satisfied throughout dynamic decoding method. Adaptive penalizing method was also proposed to handle the infeasible solutions that violate various constraints. In this paper, we proposed GA to solve hydrothermal scheduling with appropriate decoding method and dynamic penalty method. The effectiveness of the proposed method is demonstrated in the case study.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.286-289
• /
• 1989

The purpose of this paper is to design a job scheduling algorithm utilizing intelligent control technique. Rulebase is built through the evaluation of rule-set scheduling. 24 scheduling rule-sets and meta-rules are employed. An appropriate scheduling rule-set is selected based on this rulebase and current manufacturing system status. Six criteria have been used to evaluate the performance of scheduling. The performance of sheduling is dependent on random breakdown of the major FMS components during simulation.