LS Algorithm for Semi-online Scheduling Jobs with Nondecreasing Release Times and Nondecreasing Processing Times
Authors
F. Tang, J. Nie
Corresponding Author
F. Tang
Available Online June 2015.
- DOI
- 10.2991/cisia-15.2015.155How to use a DOI?
- Keywords
- release time; processing time; semi-online; LS algorithm
- Abstract
In this paper, semi-online scheduling jobs with non-decreasing release times and non-increasing processing times on m identical parallel machines is considered. The aim is to minimize the last completion time of all machines. It is proved that, for any m identical parallel machines, 3/2-1/2m is an upper bound of the worst case performance ratio of List Scheduling(LS) algorithm.
- Copyright
- © 2015, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - F. Tang AU - J. Nie PY - 2015/06 DA - 2015/06 TI - LS Algorithm for Semi-online Scheduling Jobs with Nondecreasing Release Times and Nondecreasing Processing Times BT - Proceedings of the International Conference on Computer Information Systems and Industrial Applications PB - Atlantis Press SP - 569 EP - 572 SN - 2352-538X UR - https://doi.org/10.2991/cisia-15.2015.155 DO - 10.2991/cisia-15.2015.155 ID - Tang2015/06 ER -