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

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.

[1]  Marc E. Posner,et al.  Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..

[2]  Charalambos A. Marangos,et al.  Algorithms to minimize completion time variance in a two machine flowshop , 1998 .

[3]  Fawaz S. Al-Anzi,et al.  Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications , 2002, Comput. Oper. Res..

[4]  P. S. Sundararaghavan,et al.  Minimizing makespan in parallel flowshops , 1997 .

[5]  Xiaoqiang Cai,et al.  A tight lower bound for the completion time variance problem , 1996 .

[6]  Patrick Valduriez,et al.  Principles of Distributed Database Systems , 1990 .

[7]  J.-S. Chen,et al.  Scheduling alternative operations in two-machine flow-shops , 1997 .

[8]  Chandrasekharan Rajendran,et al.  Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date , 2001, Eur. J. Oper. Res..

[9]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[10]  Ishfaq Ahmad,et al.  Design and Evaluation of Data Allocation Algorithms for Distributed Multimedia Database Systems , 1996, IEEE J. Sel. Areas Commun..

[11]  X. Chao,et al.  Operations scheduling with applications in manufacturing and services , 1999 .

[12]  M. Y. Wang,et al.  Minimizing Makespan in a Class of Reentrant Shops , 1997, Oper. Res..

[13]  V. Rajendra Prasad,et al.  Bounds for the position of the smallest job in completion time variance minimization , 1999, Eur. J. Oper. Res..

[14]  Umar Al-Turki,et al.  Tabu search for a class of single-machine scheduling problems , 2001, Comput. Oper. Res..

[15]  V. Rajendra Prasad,et al.  Pseudopolynomial algorithms for CTV minimization in single machine scheduling , 1997, Comput. Oper. Res..

[16]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[17]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[18]  Wieslaw Kubiak,et al.  Completion time variance minimization on a single machine is difficult , 1993, Oper. Res. Lett..