• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.187-190
• /
• 2003

Many manufacturing companies consider the integrated and concurrent scheduling because they need the global optimization technology that could manufacture various products more responsive to customer needs. In this paper, we propose an advanced scheduling model to generate the schedules considering resource constraints and precedence constraints in make-to-order (MTO) manufacturing environments. Precedence of work- in-process(WIP) and resources constraints have recently emerged as one of the main constraints in advanced scheduling problems. The advanced scheduling problems is formulated as a multiobjective mathematical model for generating operation schedules which are obeyed resources constraints, alternative workstations of operations and the precedence constraints of WIP in MTO manufacturing. For effectively solving the advanced scheduling problem, the multi-objective hybrid genetic algorithm (m-hGA) is proposed in this paper. The m-hGA is to minimize the makespan, total flow time of order, and maximum tardiness for each order, simultaneously. The m-hGA approach with local search-based mutation through swap mutation is developed to solve the advanced scheduling problem. Numerical example is tested and presented for advanced scheduling problems with various orders to describe the performance of the proposed m-hGA.

• 한국통신학회논문지
• /
• 제23권5호
• /
• pp.1241-1248
• /
• 1998

전송 속도가 재생 속도보다 빠른 통신망 환경에서 저장-재생 방식을 이용하여 멀티캐스팅 기회를 동적으로 생성해 멀티미디어 리트리벌 서비스의 효율을 높일 수 있다. 본 논문에서는 멀티캐스트 전송에서의 상이한 수신자 환경을 고려한 멀티캐스트 그룹 스케줄링 방법인 MTS(Maximum Throughput Scheduling) 알고리즘을 제안하였다. 이 방법은 수신자까지의 대역폭을 최대로 이용하는 단대단 전송을 반복하는 방식과 멀티캐스트 전송을 이용하여 서버의 효율을 높이는 방법을 절충한 것으로 서버의 처리율을 높일 수 있도록 가입자들의 수신율에 따라 멀티캐스트 그룹을 부그룹으로 나누어 실제 처리율이 가장 높은 세그먼트를 선택한다. MTS의 성능을 분석하기 위해 시뮬레이션을 통해 대역폭의 상이함을 고려하지 않은 알고리즘인 EDS(Earliest Deadline Scheduling), MMS(Most Multicasting Scheduling)와 비교하였다. MTS 알고리즘은 가입자들의 수신율이 상이할 때 다른 스케줄링 알고리즘에 비해 우수한 성능을 나타내는 것을 발견하였다.

• 한국콘텐츠학회논문지
• /
• 제7권10호
• /
• pp.1-9
• /
• 2007

한정된 자원을 다수의 사용자에게 분배해야 하는 무선 네트워크의 환경에서 자원의 할당과 관리는 중요하다. 이를 위해 다른 레이어 간에 통합 적응하는 레이어를 디자인해야 하는 필요성이 대두되고 있다. 본 논문에서는 크로스 레이어 기반의 스케줄링 기법에 대해 다룬다. 기존의 스케줄링 기법들 살펴보고 이를 보완한 스케줄링 기법을 제시한다. 멀티미디어 서비스 환경에서는 다양한 서비스를 제공하기 때문에 스케줄링 기법 또한 다양하게 적용할 수 있어야 한다. 따라서 기존 기법에서 적용되지 않았던 서비스에 따른 스케줄링 기법을 제시하였다. 제시한 기법은 시뮬레이션을 통해 기존의 기법에 비해 무선자원 이용효율이 뛰어남을 보였다.

• 한국건축시공학회지
• /
• 제13권6호
• /
• pp.565-578
• /
• 2013

Batch production is common in repetitive construction projects, and it is not unusual for different batch sizes to be used by contractors in one project. While several scheduling methods, such as the Linear Scheduling Method (LSM) and the Repetitive Scheduling Method (RSM) have been proposed and used, no mathematical method for repetitive construction projects has been developed, and it is difficult to consider different batch sizes with the existing methods. An original mathematical algorithm for scheduling repetitive projects with different batch sizes is proposed in this study. This algorithm is illustrated with assumptions of resource continuity and single path in a project and introduces new terms, control batch and critical batch. The algorithm logics and mathematical equations are validated by comparison with the outcomes from a graphical scheduling approach through a simple and practical hypothetic project. As a result, it is expected that the proposed algorithm can be easily adapted and extended to computer software for scheduling, and can be a starting point for research on batch size management in repetitive construction projects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.4856-4871
• /
• 2015

Backpressure based scheduling has been considered as a promising technique for improving the throughput of a wide range of communication networks. However, this scheduling technique has not been well studied for heterogeneous wireless networks. In this paper, we propose a virtual-queue based backpressure scheduling (VQB) algorithm for heterogeneous multi-hop wireless networks. The VQB algorithm introduces a simple virtual queue for each flow at a node for backpressure scheduling, whose length depends on the cache size of the node. When calculating flow weights and making scheduling decisions, the length of a virtual queue is used instead of the length of a real queue. We theoretically prove that VQB is throughput-optimal. Simulation results show that the VQB algorithm significantly outperforms a classical backpressure scheduling algorithm in heterogeneous multi-hop wireless networks in terms of the packet delivery ratio, packet delivery time, and average sum of the queue lengths of all nodes per timeslot.

• 한국컴퓨터산업학회논문지
• /
• 제8권2호
• /
• pp.89-96
• /
• 2007

객체기반 예약스케줄링 기법은 제약만족문제(CSP; Constraint Satisfaction Problem)와 객체지향개념(Object-Oriented Concepts)을 기반으로 승무원 객체들이 갖고 있는 사건들을 주어진 제약들에 만족하도록 목표인 운항스케줄 보드에 배정하는 기법이다. 본 논문에서는 객체기반 예약스케줄링기법을 항공운항 스케줄에 적용하여 승무원(운항승무원, 객실승무원)들의 운항 스케줄 만족도를 향상시키고, 승무원들에 대한 인력관리상의 문제점들을 해결하고자 하였다 특히, 승무원들의 운항스케줄에 대한 만족도를 향상시키기 위해서 전체승무원 선호도보드를 이용하였다. 승무원들의 스케줄 우선순위에 따라서 자원(타임 슬롯)을 배정하고, 자원에 대한 승무원들의 선호도 차이를 가질 수 있게 하였다. 보드에 대한 정의와 모든 사건들에 대한 정보를 전역제약으로 사용하고, 승무원들이 가지는 보드의 타임 슬롯들에 대한 선호도를 지역 제약으로 사용하였다. 또한 실제로 항공운항 스케줄링을 모의실험해서 승무원들의 운항 스케줄 만족도를 살펴보았다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권7호
• /
• pp.501-508
• /
• 2004

In this paper, a coordinated scheduling algorithm is proposed to reduce end-to-end delay in distributed control of systems. For the algorithm, the analysis of practical end-to-end delay in the worst case is performed priory with considering implementation of the systems. The end-to-end delay is composed of the delay caused by multi-task scheduling of operating systems, the delay caused by network communications, and the delay caused by asynchronous timing between operating systems and network communications. Through some simulation tests based on CAN(Controller Area Network), the proposed worst case end-to-end delay analysis is validated. Through the simulation tests, it is also shown that a real-time distributed control system designed to existing worst case delay cannot guarantee end-to-end time constraints. With the analysis, a coordinated scheduling algorithm is proposed here. The coordinated scheduling algorithm is focused on the reduction of the delay caused by asynchronous timing between operating systems and network communications. Online deadline assignment strategy is proposed for the scheduling. The performance enhancement of the distributed control systems by the scheduling algorithm is shown through simulation tests.

• 한국CDE학회논문집
• /
• 제15권1호
• /
• pp.1-10
• /
• 2010

Recently, a shipyard is making every effort to efficiently manage equipments of resources such as a gantry crane, transporter, and so on. So far block lifting scheduling of a gantry crane has been manually performed by a manager of the shipyard, and thus it took much time to get scheduling results and moreover the quality of them was not optimal. To improve this, a block lifting scheduling system of the gantry crane using optimization techniques was developed in this study. First, a block lifting scheduling problem was mathematically formulated as a multi-objective optimization problem, considering the minimization of travel distance at an idle state and wire replacement during block lifting. Then, to solve the problem, a meta-heuristic optimization algorithm based on the genetic algorithm was proposed. To evaluate the efficiency and applicability of the developed system, it was applied to an actual block lifting scheduling problem of the shipyard. The result shows that blocks can be efficiently lifted by the gantry crane using the developed system, compared to manual scheduling by a manager.

• ETRI Journal
• /
• 제33권5호
• /
• pp.689-694
• /
• 2011

In this paper, we study scheduling schemes for two-user two-way wireless relaying systems. Two transmission modes are considered: point-to-point direct transmission and two-way amplify-and-forward relaying. An optimal scheduling scheme that opportunistically selects the best transmission mode for each user is proposed to minimize the sum bit error rate (BER). The performance lower bound of the optimal scheduling scheme is analyzed, and closed-form expression of the lower-bound BER is derived. However, for optimal scheduling, the scheduler requires the knowledge of channel state information (CSI) of all links. To reduce the feedback information of CSI, we also propose a suboptimal scheduling scheme that selects the transmission mode using only the CSI of two direct links. Simulation results show that there are 4 dB to 8 dB gains for the proposed optimal and suboptimal schemes over the fixed direct transmission and fixed two-way relayed transmission scheme. The performance gap between the optimal and suboptimal scheduling schemes is small, which implies a good trade-off between implementation complexity and system performance.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2005년도 한국컴퓨터종합학술대회 논문집 Vol.32 No.1 (A)
• /
• pp.391-393
• /
• 2005

IEEE 802.16은 BWA (Broadband Wireless Access) 시스템의 표준으로 현재 많은 연구와 함께 상용 제품에 대한 연구가 진행중인 분야이다. IEEE 802.16에서는 QoS를 제공하기 위하여 BS (Base Station)와 SS(Subscriber Station)간의 QoS 협상 과정을 정의하고 있으며, BS 및 SS에서의 효율적인 QoS 보장을 위해 4가지의 서비스 클래스를 정의하고 있다. 이러한 서비스 클래스는 UGS, rtPS, nrtPS, 그리고 BE 이다. 하지만 표준에서는 이러한 서비스 클래스를 어떻게 이용할 것인지에 대한 언급이 없으며, 이에 따라 효율적인 packet scheduling에 관한 많은 연구가 진행되어 왔다. 기존의 연구에서는 주로 BS에서의 효율적인 Scheduling에 초점을 맞추어 연구가 진행되었으며, SS에서의 Scheduling에 대한 연구는 거의 되어 있지 않다. 하지만 BS에서 SS에게 대역폭을 할당할 때 GPSS (Grants per subscriber station) mode로 대역폭을 할당한다면 SS에서는 할당 받은 대역폭을 효율적으로 사용하기 위하여 scheduling이 필요하다. 본 논문에서는 SS에서의 scheduling architecture를 제안하고자 한다. 제안하는 scheduling architecture는 기존의 scheduling algorithm과는 달리 각 서비스 클래스에 대해서 효과적인 scheduling이 가능하도록 함으로써 시스템의 성능을 높이는데 기여할 것이다.