Abstract
Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in large-size computing, task arrangement in flexible manufacturing systems, etc., are multiprocessor scheduling problem. In the traditional parallel machine scheduling problems, it is assumed that the problems are considered in offline or online environment. But in practice, problems are often not really offline or online but somehow in-between. This means that, with respect to the online problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi-online ones. In this paper, the semi-online problemP2|decr|l p (p>1) is considered where jobs come in non-increasing order of their processing times and the objective is to minimize the sum of thel p norm of every machine's load. It is shown thatLS algorithm is optimal for anyl p norm, which extends the results known in the literature. Furthermore, randomized lower bounds for the problemsP2|online|l p andP2|decr|l p are presented.
This is a preview of subscription content, log in via an institution to check access.
References
Alon, N., Azar, Y., Woeginger, G., Yadid, T., 1998. Approximation schemes for scheduling.J of Scheduling,1: 55–66.
Avidor, A., Azar, Y., Sgall, J., 2001. Ancient and new algorithms for load balancing in thel p norm.Algorithmica,29: 422–441.
Azar, Y., Epstein, L., Richter, Y., Woegininger, G.J., 2002. All-norm Approximation Algorithms. Lecture Notes in Computer Science 2368, Springer-Verlag, p. 288–297.
Bartal, Y., Fiat, A., Karloff, H., Vohra, R., 1995. New algorithms for an ancient scheduling problem.J of Computer and System Science,51: 359–366.
Chandra, A.K., Wong, C.K., 1975. Worst-case analysis of a placement algorithm related to storage allocation.SIAM J on Computing,1: 249–263.
Faigle, U., Kern, W., Turan, G., 1989. On the performance of online algorithms for partition problems.Acta Cybernetica,9: 107–119.
Graham, R.L., 1966. Bounds for certain multiprocessor anomalies.Bell Systems Technical J,45: 1563–1581.
Graham, R.L., 1969. Bounds on multiprocessing timing anomalies.SIAM J on Applied Mathematics,17: 416–429.
He, Y., Yang, Q.F., Tan, Z.Y., 2003a. Semi online scheduling on parallel machines (I).Applied Mathematics—A J Chinese Universities,18A: 105–114 (in Chinese).
He, Y., Yang, Q.F., Tan, Z.Y., 2003b. Semi online scheduling on parallel machines (II).Applied Mathematics—A J Chinese Universities,18A: 213–222 (in Chinese).
Leung, J.Y.T., Wei, W.D., 1995. Tighter bounds on heuristic for a partition problem.Information Processing Letters,56: 51–57.
Seiden, S., Sgall, J., Woeginger, G.J., 2000. Semi-on-line scheduling with decreasing job sizes.Operations Research Letters,27: 215–221.
Author information
Authors and Affiliations
Additional information
Project supported by the National Natural Science Foundation of China (Nos. 10271110, 10301028) and the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of MOE, China
Rights and permissions
About this article
Cite this article
Ling, L., Zhi-yi, T. & Yong, H. Deterministic and randomized scheduling problems under thelp norm on two identical machines. J. Zheijang Univ.-Sci. A 6, 20–26 (2005). https://doi.org/10.1631/BF02842472
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/BF02842472