A minimized makespan scheduler with multiple factors for Grid computing systems

Tseng, L. Y.; Chin, Y. H.; Wang, Shu-Ching

doi:10.1016/j.eswa.2009.02.071

Cited by 20 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Energy policies establish the managing of grid resources. While other research attempts to reduce the makespan (Tseng, Chin, & Wang, 2009), the policies shown in this work aim to describe and compute what to do with a resource when it finishes the exe- cution of a job. Thus, each energy policy decides to either leave resources switched on or switch them off depending on the purpose of the policy.…”

Section: Scheduling Energy Policiesmentioning

confidence: 99%

Smart scheduling for saving energy in grid computing

Fernández-Montes

Abril

Ramírez

et al. 2012

Expert Systems with Applications

View full text Add to dashboard Cite

Section: Scheduling Energy Policiesmentioning

confidence: 99%

Smart scheduling for saving energy in grid computing

Fernández-Montes

Abril

Ramírez

et al. 2012

Expert Systems with Applications

View full text Add to dashboard Cite

“…The DR is applied for minimising the makespan and is compared to 5 existing DRs. In [42] the authors compare the performance of 5 DRs when considering setup times and three objectives, the makespan, total weighted tardiness, and computing cost. The authors combine the ATCS rule with the minimum completion time strategy to improve its performance.…”

Section: A Problem Specific Heuristics 1) Dispatching Rulesmentioning

confidence: 99%

Heuristic and Metaheuristic Methods for the Unrelated Machines Scheduling Problem: A Survey

Đurasević,

Jakobović

2021

Preprint

View full text Add to dashboard Cite

Today scheduling problems have an immense effect on various areas of human lives, be it from their application in manufacturing and production industry, transportation, or workforce allocation. The unrelated parallel machines scheduling problem (UPMSP), which is only one of the many different problem types that exist, found its application in many areas like production industries or distributed computing. Due to the complexity of the problem, heuristic and metaheuristic methods are gaining more attention for solving it. Although this problem variant did not receive much attention as other models, recent years saw the increase of research dealing with this problem. During that time, many different problem variants, solution methods, or other interesting research directions were considered. However, no study has until now tried to systematise the research in which heuristic methods are applied for the UPMSP. The goal of this study is to provide an extensive literature review on the application of heuristic and metaheuristic methods for solving the UPMSP. The research was systematised and classified into several categories to enable an easy overview of the different problem and solution variants. Additionally, current trends and possible future research directions are also shortly outlined.

show abstract

“…One is based on standard strategies, very well known as classical scheduling Heuristics such as FCFS [64], DSJF [65], HTSA [66], FT Min-Min [67] etc. Second is Modified Conventional, which is based on some modification done in standard scheduling approaches such as modified FCFS [68], modified MCT [69] etc. And the last one is QoS based conventional, which is Standard Conventional Heuristics along with Quality of Service as required by the user.…”

Section: A Conventional Scheduling Heuristicsmentioning

confidence: 99%

A Survey on Scheduling Heuristics in Grid Computing Environment

Mishra¹,

Patel²,

Rout³

et al. 2014

IJMECS

View full text Add to dashboard Cite

Job scheduling is one of the thrust research area in the discipline of Grid computing. Scheduling in the Grid environment is not only complicated but also known to be NP-Complete problem and that is all due to its unique characteristics. Thus, there are limited opportunities to find an optimal solution. In recent past, many eminent researchers reported a variety of Scheduling Heuristics that can have a substantial impact on the performance of the Grid systems. Unfortunately, it gives rise to difficulty in evaluating and keeping track of those solutions. Therefore, the motivation of this comprehensive study is to present firstly, an in-depth review of the topic under discussion mostly in the perspective of Grid Scheduling environment, and secondly, a proposal for a new state-of-the-art classification of the existing Scheduling Heuristics. All these Heuristics in each category have been further studied based on significant parameters frequently used in Scheduling Heuristics. The final part of this study includes a fair assessment of those mostly used dominating parameters. This report deals with the key concepts behind existing Scheduling Heuristics including Objectives, Types of Job Scheduling, Functionality of Grid, Nature of Grid, and the importance of the proposed classification.

show abstract

A minimized makespan scheduler with multiple factors for Grid computing systems

Cited by 20 publications

References 11 publications

Smart scheduling for saving energy in grid computing

Smart scheduling for saving energy in grid computing

Heuristic and Metaheuristic Methods for the Unrelated Machines Scheduling Problem: A Survey

A Survey on Scheduling Heuristics in Grid Computing Environment

Contact Info

Product

Resources

About