Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 394181, 6 pages
http://dx.doi.org/10.1155/2014/394181
Research Article

On-Line Booking Policies and Competitive Analysis of Medical Examination in Hospital

1Service Management Institute of Business School, Sichuan University, Chengdu 610064, China
2The West China Hospital, Sichuan University, Chengdu 610064, China

Received 8 March 2014; Accepted 17 April 2014; Published 7 May 2014

Academic Editor: Jian-Wen Peng

Copyright © 2014 Li Luo et al. 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. A. Bar-Noy, A. Freund, and J. Naor, “On-line load balancing in a hierarchical server topology,” SIAM Journal on Computing, vol. 31, no. 2, pp. 527–549, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. Y.-W. Jiang, Y. He, and C.-M. Tang, “Optimal online algorithms for scheduling on two identical machines under a grade of service,” Journal of Zhejiang University: Science, vol. 7, no. 3, pp. 309–314, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. J. Park, S. Y. Chang, and K. Lee, “Online and semi-online scheduling of two machines under a grade of service provision,” Operations Research Letters, vol. 34, no. 6, pp. 692–696, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. Y. Jiang, “Online scheduling on parallel machines with two GoS levels,” Journal of Combinatorial Optimization, vol. 16, no. 1, pp. 28–38, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. A. Zhang, Y. Jiang, and Z. Tan, “Online parallel machines scheduling with two hierarchies,” Theoretical Computer Science, vol. 410, no. 38-40, pp. 3597–3605, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. Z. Tan and A. Zhang, “A note on hierarchical scheduling on two uniform machines,” Journal of Combinatorial Optimization, vol. 20, no. 1, pp. 85–95, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. C. Phillips, C. Stein, and J. Wein, “Scheduling jobs that arrive over time,” in Proceedings of the 4th Workshop on Algorithms and Data Structures, pp. 86–97, 1995.
  8. J. A. Hoogeveen and A. P. A. Vestjens, “Optimal on-line algorithms for single-machine scheduling,” in Proceedings of the 5th Integer Programming and Combinatorial Optimization Conference (IPCO '96), pp. 404–414, 1996.
  9. P. Liu and X. Lu, “On-line scheduling of parallel machines to minimize total completion times,” Computers & Operations Research, vol. 36, no. 9, pp. 2647–2652, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. U. Faigle, W. Kern, and G. Turán, “On the performance of on-line algorithms for partition problems,” Acta Cybernetica, vol. 9, no. 2, pp. 107–119, 1989. View at Google Scholar · View at MathSciNet
  11. B. Chen and A. P. A. Vestjens, “Scheduling on identical machines: how good is LPT in an on-line setting?” Operations Research Letters, vol. 21, no. 4, pp. 165–169, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. G.-Q. Ni and Y.-F. Xu, “Competitive analysis of dynamic online booking policies in revenue management,” System Engineering Theory and Practice, vol. 31, no. 12, pp. 2308–2315, 2011 (Chinese). View at Google Scholar · View at Scopus