Heuristics for the local grid scheduling problem with processing time constraints
In this paper, the local job scheduling problem, with processing time constraints (i.e., deadline, earliest start time, reservation) in a computational grid, is addressed. The problem under investigation is formulated as a rectangular packing problem and several heuristic approaches are developed for its solution. The performance of the proposed algorithms are evaluated under different scenarios. Extensive experimental tests demonstrate that the defined solution strategies outperform the state-of-art methods.
processing time constraints job scheduling deadline rectangular packing grid computing