• Title/Summary/Keyword: Resource scheduling

Search Result 610, Processing Time 0.028 seconds

Grid Scheduling Model with Resource Performance Measurement in Computational Grid Computing (계산 그리드 컴퓨팅에서의 자원 성능 측정을 통한 그리드 스케줄링 모델)

  • Park, Da-Hye;Lee, Jong-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.5 s.43
    • /
    • pp.87-94
    • /
    • 2006
  • Grid computing has been developed for resolving large-scaled computing problems through geographically distributed heterogeneous resources. In order to guarantee effective and reliable job processing, grid computing needs resource scheduling model. So, we propose a resource performance measurement scheduling model which allocates job to resources with resource performance measurement. We assess resources using resource performance measurement formula, and implement the resource performance measurement scheduling model in DEVS simulation modeling.

  • PDF

Issues and approaches to spatial scheduling (공간 일정 계획의 이슈들과 접근방법)

  • 이경전;이재규
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.758-759
    • /
    • 1995
  • In large-scale industry such as shipbuilding, aircraft manufacturing, and construction industry etc., it is required to consider two or three-dimensional spatial availability as one of bottlenecked resource constraints. We call this kind of scheduling a spatial scheduling, which considers the dynamic spatial layouts of objects as well as the traditional resource constraints. Since 1991, we have researched on the spatial scheduling for shipbuilding plant (Lee & Lee, 1992; Lee et al., 1994, Lee et al., 1995). In this paper, we present the various issues of spatial scheduling for the researchers and developers attacking spatial scheduling problems.

  • PDF

Enhanced resource scheduling in Grid considering overload of different attributes

  • Hao, Yongsheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1071-1090
    • /
    • 2016
  • Most of scheduling methods in the Grid only consider one special attribute of the resource or one aspect of QoS (Quality of Service) of the job. In this paper, we focus on the problem that how to consider two aspects simultaneously. Based on the requirements of the jobs and the attributes of the resources, jobs are categorized into three kinds: CPU-overload, memory-overload, and bandwidth-overload jobs. One job may belong to different kinds according to different attributes. We schedule the jobs in different categories in different orders, and then propose a scheduling method-MTS (multiple attributes scheduling method) to schedule Grid resources. Based on the comparisons between our method, Min-min, ASJS (Adaptive Scoring Job Scheduling), and MRS (Multi-dimensional Scheduling) show: (1) MTS reduces the execution time more than 15% to other methods, (2) MTS improves the number of the finished jobs before the deadlines of the jobs, and (3) MTS enhances the file size of transmitted files (input files and output files) and improves the number of the instructions of the finished jobs.

A Heuristic Algorithm for Resource-Constrained Multi - Project Scheduling (자원제약하의 복수 프로젝트 일정계획을 위한 휴리스틱 알고리즘)

  • Kong, Myung-Dal;Kim, Jung-Ja
    • IE interfaces
    • /
    • v.13 no.1
    • /
    • pp.110-119
    • /
    • 2000
  • Resource-constrained project scheduling is to allocate limited resources to activities to optimize certain objective functions and to determine a start time for each activity in the project such that precedence constraints and resource requirements are satisfied. This study suggests a multi-project scheduling model which can level work loads, make the most of production capacity and restrain the delay of delivery by developing a heuristic algorithm which minimizes the project completion time and maximizes the load rate under resource constraints.

  • PDF

Strong NP-completeness of Single Machine Scheduling with Resource Dependent Release Times and Processing Times (Release와 Processing time이 투입자원에 종속적인 단일설비 일정계획문제의 Strong NP-completeness 분석)

  • Lee, Ik Sun
    • Korean Management Science Review
    • /
    • v.31 no.2
    • /
    • pp.65-70
    • /
    • 2014
  • This paper considers a single machine scheduling problem to determine release and processing times where both the release times and processing times are linearly decreasing functions of resources. The objective is to minimize the sum of the associated resource consumption cost and scheduling cost including makespan, sum of completion times, maximum lateness, or sum of lateness. This paper proves that the scheduling problem is NP-hard in the strong sense even if the release times are constant.

A Multi-Dimensional Radio Resource Scheduling Scheme for MIMO-OFDM Wireless Systems

  • Li, Lei;Niu, Zhisheng
    • Journal of Communications and Networks
    • /
    • v.8 no.4
    • /
    • pp.401-409
    • /
    • 2006
  • Orthogonal frequency division multiplexing (OFDM) and multiple input multiple output (MIMO) technologies provide additional dimensions of freedom with spectral and spatial resources for radio resource management. Multi-dimensional radio resource management has recently been identified to exploit the full dimensions of freedom for more flexible and efficient utilization of scarce radio spectrum while provide diverse quality of service (QoS) guarantees. In this work, a multi-dimensional radio resource scheduling scheme is proposed to achieve above goals in hybrid orthogonal frequency division multiple access (OFDMA) and space division multiple access (SDMA) systems. Cochannel interference (CCI) introduced by frequency reuse under SDMA is eliminated by frequency division and time division between highly interfered users. This scheme maximizes system throughput subjected to the minimum data rate guarantee. for heterogeneous users and transmit power constraint. By numerical examples, system throughput and fairness superiority of the our scheduling scheme are verified.

Optimizing Construction Alternatives for Repetitive Scheduling (반복공정 최적 공법대안 선정 방법)

  • Park, Sang-Min;Lee, Dong-Eun
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2015.05a
    • /
    • pp.132-133
    • /
    • 2015
  • Efficient scheduling and resource management are the key factor to reduce construction project budget (e.g., labor cost, equipment cost, material cost, etc.). Resource-based line of balance (LOB) technique has been used to complement the limitations of time-driven scheduling techniques (e.g., critical-path method). Optimizing construction alternatives contributes cost savings while honoring the project deadline. However, existing LOB scheduling is lack of identifying optimal resource combination. This study presents a method which identifies the optimal construction alternatives, hence achieving resource minimization in a repetitive construction by using genetic algorithm (GA). The method provides efficient planning tool that enhances the usability of the system.

  • PDF

Optimizing Construction Alternatives for Scheduling Repetitive Units

  • Park, Sang-Min;Lee, Dong-Eun
    • International conference on construction engineering and project management
    • /
    • 2015.10a
    • /
    • pp.158-160
    • /
    • 2015
  • Efficient scheduling and resource management are the key factor to reduce construction project budget (e.g., labor cost, equipment cost, material cost, etc.). Resource-based line of balance (LOB) technique has been used to complement the limitations of existing time-driven scheduling techniques (e.g., critical-path method). Optimizing construction alternatives contributes to cost savings while honoring the project deadline. However, existing LOB scheduling is lack of identifying optimal resource combination. This study presents a method which identifies the optimal construction alternatives, hence achieving resource minimization in a repetitive construction by using genetic algorithm (GA). The method provides efficient planning tool that enhances the usability of the system.

  • PDF

A Term-based Language for Resource-Constrained Project Scheduling and its Complexity Analysis

  • Kutzner, Arne;Kim, Pok-Son
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.1
    • /
    • pp.20-28
    • /
    • 2012
  • We define a language $\mathcal{RS}$, a subclass of the scheduling language $\mathcal{RS}V$ (resource constrained project scheduling with variant processes). $\mathcal{RS}$ involves the determination of the starting times for ground activities of a project satisfying precedence and resource constraints, in order to minimize the total project duration. In $\mathcal{RS}$ ground activities and two structural symbols (operators) 'seq' and 'pll' are used to construct activity-terms representing scheduling problems. We consider three different variants for formalizing the $\mathcal{RS}$-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the problem $\mathcal{RS}$ is $\mathcal{NP}$-complete. Further we show that the optimizing variant (or number variant) of the $\mathcal{RS}$-problem is computable in polynomial time iff the decision variant is computable in polynomial time.

The Study on Project Scheduling Using Genetic Algorithm (유전자 알고리즘을 이용한 프로젝트 스케줄링에 관한 연구)

  • Lee, Jae-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.735-737
    • /
    • 2009
  • Efficient scheduling for project is a major concern for software engineers. Industries simultaneously try to perform a variety method of projects with the resource-constrained scheduling. In this paper, genetic algorithm is presented to solve the scheduling problem of the resource-constrained scheduling and is substantiated with results.

  • PDF