Minimization of job waiting time variance on identical parallel machines

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 37, Issue 5, 2007, Pages 917-927

  Xu, Xiaoyun ^a   Ye, Nong ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Identical parallel machine; Job scheduling; Waiting time variance (WTV)

Indexed keywords

HEURISTIC ALGORITHMS; JOB ANALYSIS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

IDENTICAL PARALLEL MACHINE; JOB SCHEDULING; WAITING TIME VARIANCE (WTV);

PARALLEL PROCESSING SYSTEMS;

EID: 34548238766     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2007.900657     Document Type: Article

References (29)

1. E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, "Recent developments in deterministic sequencing and scheduling," in Deterministic and Stochastic Scheduling, M. A. H. Dempster, J. K. Lenstra, and A. H. G. R. Kan, Eds. Dordrecht, Germany: Reidel, 1982, pp. 35-74.
2. A. G.Merten andM. E.Muller, "Variance minimization in singlemachine sequencing problems," Manag. Sci., vol. 18, no. 9, pp. 518-528, May 1972.
3. N. Ye, X. Li, X. Xu, and T. Farley, "Job scheduling methods to reduce the variance of job waiting times on computer networks," Comput. Oper. Res., vol. 34, no. 10, pp. 3069-3083, 2007.
4. N. Ye, Z. Yang, Y.-C. Lai, and T. Farley, "Enhancing router QoS through job schedulingwith weighted shortest processing time-adjusted," Comput. Oper. Res., vol. 32, no. 9, pp. 2255-2269, 2005.
5. N. Ye, E. Gel, X. Li, T. Farley, and Y.-C. Lai, "Web-server QoS models: Applying scheduling rules from production planning," Comput. Oper. Res., vol. 32, no. 5, pp. 1147-1164, 2005.
6. N. Ye, T. Farley, X. Li, and B. Harish, "Batch scheduled admission control for computer and network systems," Inf., Knowl., Syst. Manage., vol. 5, no. 4, pp. 211-226, 2005/2006.
7. T. C. E. Cheng and S. Podolsky, Just-in-Time Manufacturing: An Introdution, 2nd ed. London, U.K.: Chapman & Hall, 1996.
8. S. Eilon and I. G. Chowdhury, "Minimizing waiting time variance in the single machine problem," Manag. Sci., vol. 23, no. 6, pp. 567-575, Feb. 1977.
9. L. Schrage, "Minimizing the time-in-system variance for a finite jobset," Manag. Sci., vol. 21, no. 5, pp. 540-543, Jan. 1975.
10. V. Vani and M. Raghavachari, "Deterministic and random single machine sequencing with variance minimization," Oper. Res., vol. 35, no. 1, pp. 111-120, Jan./Feb. 1987.
11. J. J. Kanet, "Minimizing variation of flowtime in singlemachine systems," Manag. Sci., vol. 27, no. 12, pp. 1453-1459, 1981.
12. N. G. Hall and W. Kubiak, "Proof of a conjecture of schrage about the completion time variance problem," Oper. Res. Lett., vol. 10, no. 8, pp. 467-472, Nov. 1991.
13. U. Bagchi, R. S. Sullivan, and Y. Long Chang, "Minimizing mean squared deviation of completion times about a common due date," Manag. Sci. vol. 33, no. 7, pp. 894-906, Jul. 1987.
14. W. Kubiak, "Completion time variance on a single machine is difficult," Oper. Res. Lett., vol. 14, no. 1, pp. 49-59, 1993.
15. P. De, J. B. Ghosh, and C. E. Wells, "On the minimization of completion time variance with a bicriteria extension," Oper. Res., vol. 40, no. 6, pp. 1148-1155, Nov./Dec. 1992.
16. W. Kubiak, "New result on the completion time variance minimization," Discrete Appl. Math., vol. 58, no. 2, pp. 157-168, 1995.
17. M. C. Gupta, Y. P. Gupta, and A. Kumar, "Mnimizing flow time variance in a single machine system using genetic algorithm," Eur. J. Oper. Res., vol. 70, no. 3, pp. 289-303, 1993.
18. J. A. Ventura and M. X.Weng, "Minimize single-machine comletion time variance," Manag. Sci., vol. 41, no. 9, p. 1448, Sep. 1995.
19. W. Kubiak, J. Cheng, and M. Y. Kovalyov, "Fast fully polynomial approximation schemes for minimizing completion time variance," Eur. J. Oper. Res., vol. 137, no. 2, pp. 303-309, Mar. 2002.
20. T. C. E. Cheng and C. C. S. Sin, "A state-of-art review of parallel-machine scheduling research," Eur. J. Oper. Res., vol. 47, no. 3, pp. 271-292, Aug. 1990.
21. E. Mokotoff, "Parallel machine scheduling problems: A survey," Asia-Pacific J. Oper. Res., vol. 18, no. 2, pp. 193-242, Nov. 2001.
22. K. R. Baker and G. D. Scudder, "Sequencing with earliness and tardiness penalties: A review," Oper. Res., vol. 38, no. 1, pp. 22-36, 1990.
23. N. G. Hall, "Single and multiple processor models for minimizing completion time variance," Naval Res. Logist. Q., vol. 33, pp. 49-54, 1986.
24. X. Cai and T. C. E. Cheng, "Multi-machine scheduling with variance minimization," Discrete Appl. Math., vol. 84, no. 1-3, pp. 55-70, May 1998.
25. C. A. Marangos, V. Govande, G. Srinivasan, and E. W. Zimmers Jr., "Algorithms to minimize completion time variance in a two machine flowshop," Comput. Ind. Eng., vol. 35, no. 1-2, pp. 101-104, 1998.
26. M. R. Garey and D. S. Johnson, Computers and Intractability. San Francisco, CA: Freeman, 1979.
27. M. Pinedo, Scheduling: Theory, Algorithms, and Systems, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 2002.
28. M. F. Arlitt and C. L. Williamson, "Web server workload characterization: The search for invariants," in ACM SIGMETRICS Perf. Eval. Rev., 1996, vol. 24, no. 1, pp. 126-137.
29. J. Postel The tcp maximum segment size and related topics, "Memo. RFC 879," 1983, [Online]. Available: http://rfc.net/rfc879.html.