A new algorithm for dispatching time-limited tasks

A new algorithm for dispatching time-limited tasks

0.00 Avg rating0 Votes
Article ID: iaor2006463
Country: China
Volume: 22
Issue: 3
Start Page Number: 45
End Page Number: 48
Publication Date: Sep 2004
Journal: Journal of Guangxi Normal University
Authors:
Keywords: heuristics
Abstract:

A new algorithm for dispatching time-limited tasks is advanced, and the soundness of the algorithm is proven, i.e. for any exact input, the algorithm will output an optimal solution. For given n tasks, if the deadline of the tasks is much smaller than n, then the complexity of the algorithm is near to o(n), better than other known algorithms o(n log(n)).

Reviews

Required fields are marked *. Your email address will not be published.