@article{MAKHILLAJIT20161525996,
    title = {Local Search Based Grid Scheduling Model for Independent Grid Tasks},
    journal = {Asian Journal of Information Technology},
    volume = {15},
    number = {2},
    pages = {365-371},
    year = {2016},
    issn = {1682-3915},
    doi = {ajit.2016.365.371},
    url = {https://makhillpublications.co/view-article.php?issn=1682-3915&doi=ajit.2016.365.371},
    author = {J. and},
    keywords = {Distributed computing,grid scheduling,grid task scheduling,independent task scheduling,tardiness,early job submission},
    abstract = {The grid computing is a flavor of distributed computing. It collects and coordinates resources across
the administrative domain. The heterogeneous resources turns grid scheduling as challenging one as it has to
deal resources with different resource behavior. So, the scheduler in grid environment has additional
responsibilities than any other distributed environment scheduler. This research aims at minimizing the total
tardiness of the schedule as it is directly proportionate to the cost of computation. A composite dispatching
rule with heuristics to solve the grid scheduling problem is presented here. The first part of the study narrates
about the composite dispatching rule I-ATC which is acombinationof Apparent Tardiness Cost (ATC) and
Weighted Minimum Shortest Processing Time (WMSPT). I-ATC is an attempt to favor the early submitted jobs
with along due date or with relatively low priority. These jobs may incur either early tardiness or lateness by
the traditional dispatching rules. Later part of the study deals with the combination of I-ATC with Tabu search
heuristics.}
    }