A hybrid simulated annealing heuristic for multimedia object requests scheduling problem

International Journal of Computers and Applications

Volumn 26, Issue 4, 2004, Pages 207-212

  Al Anzi, Fawaz S ^a   Allahverdi, Ali ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Client server model; Multimedia databases; Scheduling; Variance minimization

Indexed keywords

ALGORITHMS; ANNEALING; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SIMULATION; DATABASE SYSTEMS; ERROR ANALYSIS; HEURISTIC PROGRAMMING; PROBLEM SOLVING; SCHEDULING; WORLD WIDE WEB;

CLIENT-SERVER MODELS; MULTIMEDIA DATABASES; SIMULATED ANNEALING ALGORITHMS; VARIANCE MINIMIZATION;

MULTIMEDIA SYSTEMS;

EID: 4644301585     PISSN: 1206212X     EISSN: None     Source Type: Journal    
DOI: 10.1080/1206212x.2004.11441745     Document Type: Article

References (17)

1. M. Pinedo & X. Chao, Operations scheduling with applications in manufacturing and services (Boston, MA: Irwin/McGraw-Hill, 1999).
2. M.T. Ozsu & P. Valduriez, Principles of distributed database systems (New Jersey: Prentice-Hall, 1991).
3. F.S. Al-Anzi & A. Allahverdi, The relation between three-tired client-server internet database and two-machine flowshop, International Journal of Parallel and Distributed Systems and Networks, 4, 2001, 94-101.
4. A. Allahverdi & F.S. Al-Anzi, Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications, Computers and Operations Research, 29, 2002, 971-994.
5. Y.K. Kwok, K. Karlapalem, I. Ahmad, & N.M. Pun, Design and evaluation of data allocation algorithms for distributed multimedia database systems, IEEE Journal of Selected Areas in Comm., 14, 1996, 1332-1348.
6. D.K. Manna & V.R. Prasad, Pseudopolynomial algorithms for CTV minimization in single machine scheduling, Computers and Operations Research, 24, 1997, 1119-1128.
7. C.A. Marangos, V. Govande, G. Sirinvasan, & J.W. Zimmers, Algorithms to minimize completion time variance in a two-machine flowshop, Computers & Industrial Engineering, 35, 1998, 101-104.
8. G. Gowrishankar, C. Rajendran, & G. Srinivasan, Flowshop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date, European Journal of Operational Research, 132, 2001, 643-665.
9. W. Kubiak, Completion time variance minimization on a single machine is difficult, Operations Research Letters, 14, 1993, 49-59.
10. U. Al-Turki, C. Fedjki, & A. Andijani, Tabu search for a class of single-machine scheduling problems, Computers and Operations Research, 28, 2001, 1223-1230.
11. D.K. Manna & V.R. Prasad, Bounds for the position of the smallest job in completion time variance minimization, European Journal of Operational Research, 114, 1999, 411-419.
12. C.T. Ng, X. Cai, & T.C.E. Cheng, A tight lower bound for the completion time variance problem, European Journal of Operational Research, 92, 1996, 211-213.
13. H.G. Campbell, R.A. Dudek, & M.L. Smith, A heuristic algorithm for the n-job, m-machine sequencing problem, Management Science, 16, 1970, B630-B637.
14. M. Nawaz, E. Enscore, & I. Ham, A heuristic algorithm for the m-machine, n-job flowshop sequencing problem, OMEGA: The International Journal of Management Sciences, 11, 1983, 91-95.
15. M.Y. Wang, S.P. Sethi, & S.L. Van De Velde, Minimizing makespan in a class of reentrant shops, Operations Research, 45, 1997, 702-712.
16. C.H. Pan & J.S. Chen, Scheduling alternative operations in two-machine flow-shops, Journal of the Operational Research Society, 48, 1997, 533-540.
17. P.S. Sundararaghavan, A.S. Kunnathur, & I. Viswanathan, Minimizing makespan in parallel flowshops, Journal of the Operational Research Society, 48, 1997, 834-842.