Abstract
In this paper we consider three semi-online scheduling problems for jobs with release times on m identical parallel machines. The worst case performance ratios of the LS algorithm are analyzed. The objective function is to minimize the maximum completion time of all machines, i.e. the makespan. If the job list has a non-decreasing release times, then \(2-\frac{1}{m}\) is the tight bound of the worst case performance ratio of the LS algorithm. If the job list has non-increasing processing times, we show that \(2-\frac{1}{2m}\) is an upper bound of the worst case performance ratio of the LS algorithm. Furthermore if the job list has non-decreasing release times and the job list has non-increasing processing times we prove that the LS algorithm has worst case performance ratio not greater than \(\frac{3}{2} -\frac{1}{2m}\).
Similar content being viewed by others
References
Dósa G, He Y (2004) Semi-online algorithms for parallel machine scheduling problems. Computing 72:355–363
Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17:416–429
Hall LA, Shmoys DB (1989) Approximation schemes for constrained scheduling problems. In: Proceedings of 30th ann IEEE symp on foundations of computer science. IEEE Comput Soc, Los Alamitos, pp 134–139
He Y, Zhang G (1999) Semi on-line scheduling on two identical machines. Computing 62:179–187
Kellerer H, Kotov V, Speranza MG, Tuza Z (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21:235–242
Li R, Huang HC (2004) On-line scheduling for jobs with arbitrary release times. Computing 73:79–97
Li R, Huang HC (2007) List scheduling for jobs with arbitrary release times and similar lengths. J Sched 10(6):365–373
Liu WP, Sidney JB, Vliet A (1996) Ordinal algorithm for parallel machine scheduling. Oper Res Lett 18:223–232
Seiden S, Sgall J, Woeginger GJ (2000) Semi-online scheduling with decreasing job sizes. Oper Res Lett 27:215–227
Tan ZY, He Y (2002) Semi-online problem on two identical machines with combined partial information. Oper Res Lett 30:408–414
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, R., Yang, L., He, X. et al. Semi-online scheduling for jobs with release times. J Comb Optim 26, 448–464 (2013). https://doi.org/10.1007/s10878-011-9425-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-011-9425-z