Abstract
This research addresses the scheduling problem of multimedia object requests, which is an important problem in information systems, in particular, for World Wide Web applications. The performance measure considered is the variance of response time which is crucial as end users expect fair treatment to their service requests. This problem is known to be NP-hard. The literature survey indicates that two heuristics have been proposed to solve the problem. In this paper, we present a new heuristic, a hybrid evolutionary heuristic, which is shown to perform much better than the two existing ones, e.g., the overall average errors of the existing ones are 1.012 and 2.042 while the error of the proposed hybrid evolutionary heuristic is 0.154.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Al-Anzi, F. and Allahverdi, A.: The relation between three-tired client-server internet database and two-machine flowshop, Int. J. Parallel Distrib. Syst. Netw. 4 (2001), 94–101.
Allahverdi, A. and Al-Anzi, F.: Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications, Comput. Oper. Res. 29 (2002), 971–994.
Allahverdi, A., Gupta, J. N. D. and Aldowaisan, T.: A review of scheduling research involving setup considerations, OMEGA Int. J. Manag. Sci. 27 (1999), 219–239.
Al-Turki, U., Fedjki, C. and Andijani, A.: Tabu search for a class of single-machine scheduling problems, Comput. Oper. Res. 28 (2001), 1223–1230.
Campbell, H. G., Dudek, R. A. and Smith, M. L.: A heuristic algorithm for the n-job, m-machine sequencing problem, Manag. Sci. 16 (1970), B630–B637.
Gowrishankar, G., Rajendran, C. and Srinivasan, G.: Flowshop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date, Eur. J. Oper. Res. 132 (2001), 643–665.
Hall, N. G. and Posner, M. E.: Generating experimental data for computational testing with machine scheduling applications, Oper. Res. 49 (2001), 854–865.
Kubiak, W.: Completion time variance minimization on a single machine is difficult, Oper. Res. Lett. 14 (1993), 49–59.
Kwok, Y. K., Karlapalem, K., Ahmad, I. and Pun, N. M.: Design and Evaluation of Data Allocation Algorithms for Distributed Multimedia Database Systems, IEEE J. Sel. Areas in Commun. 14 (1996), 1332–1348.
Manna, D. K. and Prasad V. R.: Bounds for the position of the smallest job in completion time variance minimization, Eur. J. Oper. Res. 114 (1999), 411–419.
Manna, D. K. and Prasad V. R.: Pseudopolynomial algorithms for CTV minimization in single machine scheduling, Comput. Oper. Res. 24 (1997), 1119–1128.
Marangos, C. A., Govande, V., Sirinvasan, G. and Zimmers Jr., W.: Algorithms to minimize completion time variance in a two-machine flowshop, Comput. Ind. Eng. 35 (1998), 101–104.
Nawaz, M., Enscore, E. and Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem, OMEGA Int. J. Manag. Sci. 11 (1983), 91–95.
Ng, C. T., Cai, X. and Cheng, T. C. E.: A tight lower bound for the completion time variance problem, Eur. J. Oper. Res. 92 (1996), 211–213.
Ozsu, M. T. and Valduriez, P.: Principles of Distributed Database Systems, Prentice-Hall, New Jersey, 1991.
Pan, C. H. and Chen, J. S.: Scheduling alternative operations in two-machine flow-shops, J. Oper. Res. Soc. 48 (1997), 533–540.
Pinedo, M. and Chao, X.: Operations Scheduling with Applications in Manufacturing and Services, Irwing McGraw-Hill, Boston, 1999.
Sundararaghavan, P. S., Kunnathur, A. S. and Viswanathan, I.: Minimizing makespan in parallel flowshops, J. Oper. Res. Soc. 48 (1997), 834–842.
Wang, M. Y., Sethi, S. P. and Van De Velde, S. L.: Minimizing makespan in a class of reentrant shops, Oper. Res. 45 (1997), 702–712.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Al-Anzi, F.S., Allahverdi, A. Using a Hybrid Evolutionary Algorithm to Minimize Variance in Response Time for Multimedia Object Requests. J Math Model Algor 4, 435–453 (2005). https://doi.org/10.1007/s10852-005-9027-9
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-005-9027-9