Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 343287, 7 pages
http://dx.doi.org/10.1155/2013/343287
Research Article

WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines

1Department of Automation, Xiamen University, Xiamen, China
2Center for Cloud Computing and Big Data, Xiamen University, Xiamen, China

Received 9 June 2013; Accepted 5 September 2013

Academic Editor: Dane Quinn

Copyright © 2013 Jiping Tao and Tundong Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Leonardi, “A simpler proof of preemptive total flow time approximation on parallel machines,” in Efficient Approximation and Online Algorithms, vol. 3484 of Lecture Notes in Computer Science, pp. 203–212, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. S. Leonardi and D. Raz, “Approximating total flow time on parallel machines,” Journal of Computer and System Sciences, vol. 73, no. 6, pp. 875–891, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. J. A. Hoogeveen and A. P. A. Vestjens, “Optimal on-line algorithms for single-machine scheduling,” in Integer Programming and Combinatorial Optimization, vol. 1084 of Lecture Notes in Computer Science, pp. 404–414, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  5. C. Phillips, C. Stein, and J. Wein, “Minimizing average completion time in the presence of release dates,” Mathematical Programming, vol. 82, no. 1-2, pp. 199–223, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. E. J. Anderson and C. N. Potts, “Online scheduling of a single machine to minimize total weighted completion time,” Mathematics of Operations Research, vol. 29, no. 3, pp. 686–697, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. X. Lu, R. A. Sitters, and L. Stougie, “A class of on-line scheduling algorithms to minimize total completion time,” Operations Research Letters, vol. 31, no. 3, pp. 232–236, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. J. R. Correa and M. R. Wagner, “Lp-based online scheduling: from single to parallel machines,” in Integer Programming and Combinatorial Optimization, vol. 3509 of Lecture Notes in Computer Science, pp. 196–209, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. H. Kellerer, T. Tautenhahn, and G. J. Woeginger, “Approximability and nonapproximability results for minimizing total flow time on a single machine,” SIAM Journal on Computing, vol. 28, no. 4, pp. 1155–1166, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. D. P. Bunde, “SPT is optimally competitive for uniprocessor flow,” Information Processing Letters, vol. 90, no. 5, pp. 233–238, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. C. Chekuri, S. Khanna, and A. Zhu, “Algorithms for minimizing weighted flow time,” in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 84–93, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  12. N. Bansal and K. Dhamdhere, “Minimizing weighted flow time,” ACM Transactions on Algorithms, vol. 3, no. 4, pp. 39.1–39.14, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  13. J. Tao, Z. Chao, and Y. Xi, “A novel way to analyze competitive performance of online algorithms,” in Proceedings of the IAENG International Conference on Computer Science, pp. 592–597, 2009.
  14. J. P. Tao, Z. J. Chao, and Y. G. Xi, “A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times,” Journal of Industrial and Management Optimization, vol. 6, no. 2, pp. 269–282, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. J. P. Tao, Z. J. Chao, Y. G. Xi, and Y. Tao, “An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time,” Information Processing Letters, vol. 110, no. 8-9, pp. 325–330, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. M. C. Chou, M. Queyranne, and D. Simchi-Levi, “The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates,” Mathematical Programming, vol. 106, no. 1, pp. 137–157, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. M. X. Goemans, M. Queyranne, A. S. Schulz, M. Skutella, and Y. Wang, “Single machine scheduling with release dates,” SIAM Journal on Discrete Mathematics, vol. 15, no. 2, pp. 165–192, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet