Skip to main content
SpringerLink
Log in

Using a Hybrid Evolutionary Algorithm to Minimize Variance in Response Time for Multimedia Object Requests

  • Published:
Journal of Mathematical Modelling and Algorithms

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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.

    Google Scholar 

  2. 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.

    Article  MATH  Google Scholar 

  3. 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.

    Article  Google Scholar 

  4. 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.

    Article  MATH  MathSciNet  Google Scholar 

  5. 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.

    Google Scholar 

  6. 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.

    Article  MATH  Google Scholar 

  7. Hall, N. G. and Posner, M. E.: Generating experimental data for computational testing with machine scheduling applications, Oper. Res. 49 (2001), 854–865.

    Article  MathSciNet  MATH  Google Scholar 

  8. Kubiak, W.: Completion time variance minimization on a single machine is difficult, Oper. Res. Lett. 14 (1993), 49–59.

    Article  MATH  MathSciNet  Google Scholar 

  9. 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.

    Article  Google Scholar 

  10. 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.

    Article  MATH  Google Scholar 

  11. Manna, D. K. and Prasad V. R.: Pseudopolynomial algorithms for CTV minimization in single machine scheduling, Comput. Oper. Res. 24 (1997), 1119–1128.

    Article  MathSciNet  MATH  Google Scholar 

  12. 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.

    Article  Google Scholar 

  13. 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.

    Article  Google Scholar 

  14. 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.

    Article  MATH  Google Scholar 

  15. Ozsu, M. T. and Valduriez, P.: Principles of Distributed Database Systems, Prentice-Hall, New Jersey, 1991.

    Google Scholar 

  16. Pan, C. H. and Chen, J. S.: Scheduling alternative operations in two-machine flow-shops, J. Oper. Res. Soc. 48 (1997), 533–540.

    Article  MATH  Google Scholar 

  17. Pinedo, M. and Chao, X.: Operations Scheduling with Applications in Manufacturing and Services, Irwing McGraw-Hill, Boston, 1999.

    MATH  Google Scholar 

  18. Sundararaghavan, P. S., Kunnathur, A. S. and Viswanathan, I.: Minimizing makespan in parallel flowshops, J. Oper. Res. Soc. 48 (1997), 834–842.

    Article  MATH  Google Scholar 

  19. 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.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, College of Engineering and Petroleum, Kuwait University, P.O. Box 5969, Safat, Kuwait

    Fawaz S. Al-Anzi

  2. Department Industrial and Management Systems Engineering, College of Engineering and Petroleum, Kuwait University, P.O. Box 5969, Safat, Kuwait

    Ali Allahverdi

Authors
  1. Fawaz S. Al-Anzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ali Allahverdi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fawaz S. Al-Anzi.

Rights and permissions

Reprints 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

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-005-9027-9

Mathematical Subject Classification (2000)

Key words

Search

Navigation