The makespan problem of scheduling multi groups of jobs on multi processors at different speeds

Authors

  • Wei Ding Sun Yat-sen University

Keywords:

Heuristic algorithm, LPT algorithm, approximate solutions, optimal solutions, upper bound

Abstract

In the paper we mainly study the makespan problem of scheduling <em>n</em> groups of jobs on <em>n</em> special-purpose processors and <em>m</em> general-purpose processors at different speeds. We first propose an improved <em>LPT</em> algorithm and investigate several properties of this algorithm. We then obtain an upper bound for the ratio of the approximate solution <em>T</em> to the optimal solution <em>T</em><sup>*</sup> under the improved <em>LPT</em> algorithm.

Downloads

Additional Files

Published

2012-07-26

How to Cite

Ding, W. (2012). The makespan problem of scheduling multi groups of jobs on multi processors at different speeds. Algorithmic Operations Research, 7(1), Pages 41 – 50. Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/18367

Issue

Vol. 7 No. 1 (2012)

Section

Articles

License

The copyright of the submitted article is hereby transferred to “Preeminent Academic Facets Inc. (the “publisher”) to the extent possible by the laws in the respective countries of the author(s). The author(s) retain all other rights including the following: 1. Any patents and trademark rights. 2. Right to post a pre-print version of the paper on the author’s personal website which is not used for commercial purposes. The author(s) warrant that the work is original, it has not been published elsewhere, it is not currently under consideration for publication in any form, and it does not infringe any copyright laws. The signing author or agent further warrants that all authors, if applicable, have been informed of the terms of this agreement and obtained the approval and authority to sign the agreement.