Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 576234, 6 pages
http://dx.doi.org/10.1155/2014/576234
Research Article

Semi-Online Scheduling on Two Machines with GoS Levels and Partial Information of Processing Time

1Business School, Sichuan University, Chengdu 610065, China
2State Key Lab for Manufacturing Systems Engineering, Xi’an 710049, China

Received 15 November 2013; Accepted 19 December 2013; Published 11 February 2014

Academic Editors: J. G. Barbosa and D. Oron

Copyright © 2014 Taibo Luo and Yinfeng Xu. 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. H.-C. Hwang, S. Y. Chang, and K. Lee, “Parallel machine scheduling under a grade of service provision,” Computers and Operations Research, vol. 31, no. 12, pp. 2055–2061, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. 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 Google Scholar · View at Scopus
  3. J. Ou, J. Y.-T. Leung, and C.-L. Li, “Scheduling parallel machines with inclusive processing set restrictions,” Naval Research Logistics, vol. 55, no. 4, pp. 328–338, 2008. View at Publisher · View at Google Scholar · View at Scopus
  4. M. Ji and T. C. E. Cheng, “An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan,” Information Processing Letters, vol. 108, no. 4, pp. 171–174, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. G. J. Woeginger, “A comment on parallel-machine scheduling under a grade of service provision to minimize makespan,” Information Processing Letters, vol. 109, no. 7, pp. 341–342, 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. 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 Scopus
  7. 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 Scopus
  8. 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 Scopus
  9. M. Liu, C. Chu, Y. Xu, and F. Zheng, “Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times,” Journal of Combinatorial Optimization, vol. 21, no. 1, pp. 138–149, 2011. View at Publisher · View at Google Scholar · View at Scopus
  10. M. Liu, Y. Xu, C. Chu, and F. Zheng, “Online scheduling on two uniform machines to minimize the makespan,” Theoretical Computer Science, vol. 410, no. 21-23, pp. 2099–2109, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. X. Lu and Z. Liu, “Semi-online scheduling problems on two uniform machines under a grade of service provision,” Theoretical Computer Science, vol. 489-490, pp. 58–66, 2013. View at Publisher · View at Google Scholar
  12. Y. Wu, M. Ji, and Q. Yang, “Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision,” International Journal of Production Economics, vol. 135, no. 1, pp. 367–371, 2012. View at Publisher · View at Google Scholar · View at Scopus
  13. A. Zhang, Y. Jiang, L. Fan, and J. Hu, “Optimal online algorithms on two hierarchical machines with tighly-grouped processing times,” Journal of Combinatorial Optimization, 2013. View at Publisher · View at Google Scholar