• 산업경영시스템학회지
• /
• 제15권26호
• /
• pp.21-31
• /
• 1992

Today, manpower is used as a major factor in the production of service industry that is on the increasing trend. So the research on manpower structure have been regarded as a important field. The research on personnel scheduling, however, have got de-emphasizeed as compared wi th the field of manufacturing scheduling. As the increasing trend of service industry, an appropriate personnel scheduling for each type of service industry is needed urgently. This paper deals with nurse scheduling problem in the field of personnel scheduling. We aim at developing prototype of the expert nurse scheduling program which is easy to use when scheduling without help of expert, and satisfies the various request of hospital scheduling policy and nurse scheduling.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2005년도 춘계학술대회 논문집
• /
• pp.29-33
• /
• 2005

Grid computing is widely applicable to various fields of industry including process control and manufacturing, military command and control, transportation management, and so on. In a viewpoint of application area, grid computing can be classified to three aspects that are computational grid, data grid and access grid. This paper focuses on computational grid which handles complex and large-scale computing problems. Computational grid is characterized by system dynamics which handles a variety of processors and jobs on continuous time. To solve problems of system complexity and reliability due to complex system dynamics, computational grid needs scheduling policies that allocate various jobs to proper processors and decide processing orders of allocated jobs. This paper proposes the service prediction-based job scheduling model and present its algorithm that is applicable for computational grid. The service prediction-based job scheduling model can minimize overall system execution time since the model predicts a processing time of each processing component and distributes a job to processing component with minimum processing time. This paper implements the job scheduling model on the DEVSJAVA modeling and simulation environment and simulates with a case study to evaluate its efficiency and reliability Empirical results, which are compared to the conventional scheduling policies such as the random scheduling and the round-robin scheduling, show the usefulness of service prediction-based job scheduling.

• 한국시뮬레이션학회논문지
• /
• 제14권3호
• /
• pp.91-100
• /
• 2005

Grid computing is widely applicable to various fields of industry including process control and manufacturing, military command and control, transportation management, and so on. In a viewpoint of application area, grid computing can be classified to three aspects that are computational grid, data grid and access grid. This paper focuses on computational grid which handles complex and large-scale computing problems. Computational grid is characterized by system dynamics which handles a variety of processors and jobs on continuous time. To solve problems of system complexity and reliability due to complex system dynamics, computational grid needs scheduling policies that allocate various jobs to proper processors and decide processing orders of allocated jobs. This paper proposes a service prediction-based job scheduling model and present its scheduling algorithm that is applicable for computational grid. The service prediction-based job scheduling model can minimize overall system execution time since the model predicts the next processing time of each processing component and distributes a job to a processing component with minimum processing time. This paper implements the job scheduling model on the DEVS modeling and simulation environment and evaluates its efficiency and reliability. Empirical results, which are compared to conventional scheduling policies, show the usefulness of service prediction-based job scheduling.

• 컴퓨터교육학회논문지
• /
• 제9권6호
• /
• pp.89-98
• /
• 2006

최근 들어, 그리드 컴퓨팅 환경은 웹 서비스와 통합된 서비스 기반 그리드 컴퓨팅 환경으로 변화하고 있다. 이러한 구조에서의 그리드 어플리케이션은 워크플로우에 띠라 그리드 서비스가 수행되는 서비스 기반 그리드 어플리케이션이 되게 된다. 이것은 그리드 스케줄링 기법에서 그리드 서비스의 특징을 고려해야 한다는 것을 의미한다. 따라서 본 논문에서는 그리드 서비스의 가용성, 접근성, 신뢰성, 처리율, 감속속도에 바탕을 둔 그리드 서비스 성능 모델을 제안하고 서비스 기반 그리드 어플리케이션의 성능향상을 위해서 서비스 스케줄링 기법을 개발한다.

• Journal of Communications and Networks
• /
• 제7권4호
• /
• pp.408-416
• /
• 2005

Quality of service (QoS) provision is an important and indispensable function for multi-service wireless networks. In this paper, we present a new scheduling/admission control frame­work, including an efficient rate-guaranteed opportunistic scheduling (ROS) scheme and a coordinated admission control (ROS­CAC) policy to support statistic QoS guarantee in multi-service wireless networks. Based on our proposed mathematical model, we derive the probability distribution function (PDF) of queue length under ROS and deduce the packet loss rate (PLR) for individual flows. The new admission control policy makes admission decision for a new incoming flow to ensure that the PLR requirements of all flows (including the new flow) are satisfied. The numerical results based on ns-2 simulations demonstrate the effectiveness of the new joint packet scheduling/admission control framework.

• 산업경영시스템학회지
• /
• 제30권1호
• /
• pp.59-65
• /
• 2007

HPI (High-speed Portable Internet) system which provides high speed internet services is going to be commercialized soon. Since HPI provides simultaneously four different service types such as UGS (Unsolicited Grant Service), rtPS (real time Polling Service), nrtPS(non-real time Polling Service), and BE (Best Effort) under different QoS (Quality of Service) requirements and limited wireless channel resources, efficient packet scheduling mechanisms are necessary to increase the utilization of channels as well as to satisfy the various QoS requirements. This study regards the traffic data to be served as time series and proposes a new packet scheduling algorithm based on the nonparametric statistical test. The performance of the newly proposed algorithm is evaluated through the simulation analysis using a simulator that can evaluate the performance of packet scheduling mechanisms under various values of system parameters and measures such as packet delay time, data transmission rate, number of loss packets, and channel utilization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권3호
• /
• pp.551-569
• /
• 2024

With the rapid development of electric vehicles (EVs) industry, EV charging service becomes more and more important. Especially, in the case of suddenly drop of air temperature or open holidays that large-scale EVs seeking for charging devices (CDs) in a short time. In such scenario, inefficient EV charging scheduling algorithm might lead to a bad service quality, for example, long queueing times for EVs and unreasonable idling time for charging devices. To deal with this issue, this paper propose a Deep-Q-Network (DQN) based two-stage scheduling method for the large-scale EVs charging service. Fine-grained states with two delicate neural networks are proposed to optimize the sequencing of EVs and charging station (CS) arrangement. Two efficient algorithms are presented to obtain the optimal EVs charging scheduling scheme for large-scale EVs charging demand. Three case studies show the superiority of our proposal, in terms of a high service quality (minimized average queuing time of EVs and maximized charging performance at both EV and CS sides) and achieve greater scheduling efficiency. The code and data are available at THE CODE AND DATA.

• 한국통신학회논문지
• /
• 제29권5A호
• /
• pp.574-582
• /
• 2004

본 논문에서는 패킷 데이터 서비스를 지원하는 DS/CDMA 시스템에서 역방향 링크의 대기 패킷 버스트들이 겪는 평균 전송 시간을 최소화하기 위한 여러 가지 패킷 스캐줄링 방식을 비교 분석하였다. 모든 활성화된 데이터 사용자들이 동시에 전송을 하는 경우의 최적의 스케줄링 방식에 대하여 논하고 기존의 여러 가지 다른 전송률 스케줄링 방식들과의 수학적인 비교 분석을 통하여 평균 전송 지연을 고려한 전송률 스케줄링 방식의 효율적인 지표를 제시하였다.

• 산업공학
• /
• 제19권3호
• /
• pp.202-213
• /
• 2006

In this paper, we develop a planning system for the routing and scheduling of vehicles in pickup and delivery service such as door-to-door parcel service. Efficient routing and scheduling of vehicles is very important in pickup and delivery service. The routing and scheduling problem is a variation of vehicle routing problem which has various realistic constraints. We develop a heuristic algorithm based on tabu search to solve the routing and scheduling problem. We develop a routing and scheduling system installed the algorithm as a planning engine. The system manage the basic data and uses GIS data to make a realistic route plan.

• 대한전자공학회논문지TC
• /
• 제40권12호
• /
• pp.46-58
• /
• 2003

최근의 인터넷은 기존의 최선형 서비스구조(best-effort)에서 벗어나 별도의 차별화 된 트래픽 처리와 서비스품질(QoS)을 요구하는 응용들을 지원할 수 있는 네트워크 구조 및 트래픽 엔지니어링 기술을 요구하고있다. 더욱이 유선에서 무선으로 인터넷이 확장되면서 위치-종속적이며 버스트하게 발생되는 에러로 인해 기존의 패킷 스케줄링 방법으로는 정의된 서비스 품질을 제공할 수 없다. 따라서 본 논문에서 무선 인터넷 차별화 서비스 네트워크 환경에서도 정의된 서비스 품질을 제공할 수 있는 WDSPS(Wireless DiffServ Packet Scheduling) 스케줄링 알고리즘을 제안한다. 제안된 스케줄링 알고리즘은 무선망 에러로 생기는 클래스 큐의 블록킹 문제를 해결하고, 차별화 서비스 망에서 요구하는 각 클래스간 패킷 처리율, 패킷 지연, 패킷 손실률 등의 관점에서 차별화 서비스를 제공하며, 클래스 및 플로우간 효율적인 보상 방법으로 서비스 보상이 점진적으로 이루어져 하나의 클래스 및 플로우가 독점적으로 무선자원을 사용하지 못하도록 하였다. 모의 실험에서는 제안된 WDSPS 스케줄링 방법을 사용하여 다양한 무선 환경에서 서비스 클래스간 차별화 된 서비스를 제공하며 전체 서비스 처리율을 향상시킬 수 있음을 보였다.