Title :
Semi-online scheduling problems on m parallel identical machines
Author_Institution :
Coll. of Math. & Inf. Sci., Wenzhou Univ., Wenzhou, China
Abstract :
This paper investigates the semi-online scheduling problems on m parallel identical machines with non-simultaneous machine available times. The objective is to maximize the minimum machine completion time. For the semi-online version with jobs arrived in non-increasing processing time order, LS is showed an optimal algorithm for three and four machines cases and the lower bound 10/7 is presented when m is greater than or equal to five.
Keywords :
optimisation; parallel machines; minimum machine completion time; parallel identical machine; semionline scheduling problem; Educational institutions; Helium; Operations research; Parallel machines; Processor scheduling; Schedules; Scheduling; competitive ratio; optimal algorithm; scheduling; semi-online;
Conference_Titel :
Information Technology and Artificial Intelligence Conference (ITAIC), 2011 6th IEEE Joint International
Conference_Location :
Chongqing
Print_ISBN :
978-1-4244-8622-9
DOI :
10.1109/ITAIC.2011.6030207
