Job scheduling methods for reducing waiting time variance

Computers and Operations Research

Volumn 34, Issue 10, 2007, Pages 3069-3083

  Ye, Nong ^a   Li, Xueping ^a   Farley, Toni ^a   Xu, Xiaoyun ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Computer networks; Job scheduling; Quality of Service (QoS); Waiting time variance

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; HEURISTIC METHODS; PROBLEM SOLVING; QUALITY OF SERVICE;

BALANCED SPIRAL; JOB SCHEDULING; VERIFIED SPIRAL; WAITING TIME VARIANCE;

SCHEDULING;

EID: 33847627486     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.11.015     Document Type: Article

References (38)

1. Ye N. QoS-centric stateful resource management in information systems. Information Systems Frontiers 4 2 (2002) 149-160
2. Chen Y., Farley T., and Ye N. QoS requirements of network applications on the Internet. Information, Knowledge, Systems Management 4 1 (2003)
3. Merten A.G., and Muller M.E. Variance minimization in single machine sequencing problems. Management Science 18 (1972) 518-528
4. Pinedo M. Scheduling theory, algorithms and systems (1995), Prentice-Hall, Englewood Cliffs, NJ
5. Ye N, Bashettihalli H, Li X, Farley T. Batch scheduled admission control for service dependability of computer and network resources. Information, Knowledge, Systems Management, submitted for publication.
6. Maheswaran M. Quality of service driven resource management algorithms for network computing. International Conference on Parallel and Distributed Processing Technologies and Applications, 1999.
7. Anderson EJ, Potts CN. On-line scheduling of a single machine to minimize total weighted completion time. Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
8. Rana OF, Winikoff M, Padgham L, Harland J. Applying conflict management strategies in BDI agents for resource management in computational grids. Proceedings of the Australasian Conference on Computer Science, 2002.
9. Alhusaini AH, Prasanna VK, Raghavendra CS. A unified resource scheduling framework for heterogeneous computing environments. Eighth Heterogeneous Computing Workshop, 1999.
10. Smith W, Foster I, Taylor V. Scheduling with advanced reservations. International Parallel and Distributed Processing Symposium, 2000.
11. Hollingsworth J, Maneewongvatana S. Imprecise calendars: an approach to scheduling computational grids. International Conference on Distributed Computing Systems, 1999.
12. Casavant T.L., and Kuhl J.G. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Transactions on Software Engineering 14 2 (1988) 141-154
13. Adam T.L., Chandy K.M., and Dickson J.R. A comparison of list schedules for parallel processing systems. Communications of the ACM 17 12 (1974) 685-690
14. Ecker K.H., Pesch E., Schmidt G., Weglarz J., and Blazewicz J. Scheduling computer and manufacturing processes (1996), Springer, Berlin
15. Schrage L. Minimizing the time-in-system variance for a finite jobset. Management Science 21 5 (1975) 540-543
16. Mittenthal J., Raghavachari M., and Rana A.I. V- and Λ-shaped properties for optimal single machine schedules for a class of non-separable penalty functions. European Journal of Operational Research 86 2 (1995) 262-269
17. Al-Turki U., Fediki C., and Andijani A. Tabu search for a class of single-machine scheduling problems. Computers and Operation Research 28 12 (2001) 1223-1230
18. Viswanathkumar G., and Srinivasan G. A branch and bound algorithm to minimize completion time variance on a single processor. Computers and Operations Research 30 8 (2003) 1135-1150
19. De P., Ghosh J.B., and Wells C.E. Scheduling to minimize the coefficient of variation. Internatinal Journal of Production Economics 44 (1996) 249-253
20. Kubiak W., Cheng J., and Kovalyov M.Y. Fast fully polynomial approximation schemes for minimizing completion time variance. European Journal of Operational Research 137 2 (2002) 303-309
21. Kubiak W. New results on the completion time variance minimization. Discrete Applied Mathematics 58 2 (1995) 157-168
22. Cai X. V-shape property for job sequences that minimize the expected completion time variance. European Journal of Operational Research 91 1 (1996) 118-123
23. Manna D.K., and Prasad V.R. Pseudopolynomial algorithms for CTV minimization in single machine scheduling. Computers and Operations Research 24 12 (1997) 1119-1128
24. Lu X., Sitters R.A., and Stougie L. A class of on-line scheduling algorithms to minimize total completion time. Operations Research Letters 31 3 (2003) 232-236
25. Kanet J.J. Minimizing variation of flow time in single machine systems. Management Science 27 12 (1981) 1453-1459
26. Hall N.G., and Kubiak W. Proof of a conjecture of Schrage about the completion time variance problem. Operations Research Letters 10 8 (1991) 467-472
27. Vani V., and Raghavachari M. Deterministic and random single machine sequencing with variance minimization. Operations Research 35 1 (1987) 111-120
28. Kubiak W. Completion time variance minimization on a single machine is difficult. Operations Research Letters 14 1 (1993) 49-59
29. Manna D.K., and Prasad V.R. Bounds for the position of the smallest job in completion time variance minimization. European Journal of Operational Research 114 2 (1999) 411-419
30. Mosheiov G. Minimizing mean absolute deviation of job completion times from the mean completion time. Naval Research Logistics 47 8 (2000) 657-668
31. Jurisch B., Kubiak W., and Jozefowska J. Algorithms for minclique scheduling problems. Discrete Applied Mathematics 72 1-2 (1997) 115-139
32. De P., Ghosh J.B., and Wells C.E. On the minimization of completion time variance with a bicriteria extension. Operations Research 40 6 (1992) 1148
33. Eilon S., and Chowdhury I.G. Minimizing waiting time variance in the single machine problem. Management Science 23 (1977) 567-574
34. Ye N., Gel E.S., Li X., Farley T., and Lai Y.C. Web server QoS models: applying scheduling rules from production planning. Computers and Operations Research 32 (2005) 1147-1164
35. Postel J. The TCP maximum segment size and related topics. RFC 879, 1983; URL: http://rfc.net/rfc879.html
36. Arlitt MF, Williamson CL. Web server workload characterization: the search for invariants. Proceedings of the ACM SIGMET-RICS, 1996.
37. Li X, Ye N, Xu X. Influencing factors of job waiting time variance for minimizing waiting time variance, submitted for publication.
38. Xu X, Ye N. Minimization of job waiting time variance on identical parallel machines, submitted for publication.