Scheduling of variable-time jobs for distributed systems with heterogeneous processor cardinality

Authors:
Jan-Jan Wu;Hung-Jui Chang;Yu-Fan Ho;Pangfeng Liu
Affiliations:
Institute of Information Science, Research Center for Information Technology Innovation, Academia Sinica, Taipei 115, Taiwan.;Department of Computer Science and Information Engineering, National Taiwan University, Taipei 106, Taiwan.;Department of Computer Science and Information Engineering, National Taiwan University, Taipei 106, Taiwan.;Department of Computer Science and Information Engineering, National Taiwan University, Taipei 106, Taiwan
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2012

Citing 8
Cited 0

Scheduling to minimize average completion time: off-line and on-line algorithms

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximation techniques for average completion time scheduling

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Better Bounds for Online Scheduling

SIAM Journal on Computing
On an on-line scheduling problem for parallel jobs

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Heuristic Algorithms and Scatter Search for the Cardinality Constrained P|Cmax Problem

Journal of Heuristics
NP-complete scheduling problems

Journal of Computer and System Sciences
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes scheduling algorithms for assigning jobs with different release time and execution time to machines with heterogeneous processor cardinality. We show that this scheduling problem is NP-complete, and propose dynamic programming to find the optimal schedules. Since the dynamic programming is time-consuming, we propose techniques that improve the efficiency of the dynamic programming. We also propose heuristic algorithms for this scheduling problem. Experimental results demonstrate that some of the heuristics not only compute the answer efficiently but also provide good solutions.