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

A Competitive Two-Agent Scheduling Problem on Parallel Machines with Release Dates and Preemption

1School of Information Technology, Jiangxi Key Laboratory of Data and Knowledge Engineering, Jiangxi University of Finance and Economics, Nanchang, Jiangxi 330013, China
2School of Information Technology, Jiangxi University of Finance and Economics, Nanchang, Jiangxi 330013, China

Received 12 August 2013; Accepted 6 October 2013

Academic Editor: Yunqiang Yin

Copyright © 2013 Yawei Qi and Long Wan. 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. W. A. Horn, “Some simple scheduling algorithms,” Naval Research Logistics Quarterly, vol. 21, pp. 177–185, 1974. View at Google Scholar · View at MathSciNet
  2. S. Sahni, “Preemptive scheduling with due dates,” Operations Research, vol. 27, no. 5, pp. 925–934, 1979. View at Publisher · View at Google Scholar · View at MathSciNet
  3. S. Sahni and Y. Cho, “Scheduling independent tasks with due times on a uniform processor system,” Journal of the Association for Computing Machinery, vol. 27, no. 3, pp. 550–563, 1980. View at Publisher · View at Google Scholar · View at MathSciNet
  4. E. L. Lawler and J. Labetoulle, “On preemptive scheduling of unrelated parallel processors by linear programming,” Journal of the Association for Computing Machinery, vol. 25, no. 4, pp. 612–619, 1978. View at Publisher · View at Google Scholar · View at MathSciNet
  5. J. Labetoulle, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Preemptive scheduling of uniform machines subject to release dates,” in Progress in Combinatorial Optimization, pp. 245–261, Academic Press, Toronto, Canada, 1984. View at Google Scholar · View at MathSciNet
  6. E. L. Lawler and C. U. Martel, “Computing maximal “polymatroidal” network flows,” Mathematics of Operations Research, vol. 7, no. 3, pp. 334–347, 1982. View at Publisher · View at Google Scholar · View at MathSciNet
  7. C. Martel, “Preemptive scheduling with release times, deadlines and due times,” Journal of the Association for Computing Machinery, vol. 29, no. 3, pp. 812–829, 1982. View at Publisher · View at Google Scholar · View at MathSciNet
  8. K. R. Baker and J. C. Smith, “A multiple-criterion model for machine scheduling,” Journal of Scheduling, vol. 6, no. 1, pp. 7–16, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  9. A. Agnetis, P. B. Mirchandani, D. Pacciarelli, and A. Pacifici, “Scheduling problems with two competing agents,” Operations Research, vol. 52, no. 2, pp. 229–242, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  10. A. Agnetis, D. Pacciarelli, and A. Pacifici, “Multi-agent single machine scheduling,” Annals of Operations Research, vol. 150, pp. 3–15, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  11. T. C. E. Cheng, C. T. Ng, and J. J. Yuan, “Multi-agent scheduling on a single machine with max-form criteria,” European Journal of Operational Research, vol. 188, no. 2, pp. 603–609, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  12. T. C. E. Cheng, C. T. Ng, and J. J. Yuan, “Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs,” Theoretical Computer Science, vol. 362, no. 1–3, pp. 273–281, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  13. J. J. Yuan, W. P. Shang, and Q. Feng, “A note on the scheduling with two families of jobs,” Journal of Scheduling, vol. 8, no. 6, pp. 537–542, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  14. C. T. Ng, T. C. E. Cheng, and J. J. Yuan, “A note on the complexity of the problem of two-agent scheduling on a single machine,” Journal of Combinatorial Optimization, vol. 12, no. 4, pp. 387–394, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  15. B. Mor and G. Mosheiov, “Scheduling problems with two competing agents to minimize minmax and minsum earliness measures,” European Journal of Operational Research, vol. 206, no. 3, pp. 540–546, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  16. J. Y.-T. Leung, M. Pinedo, and G. Wan, “Competitive two-agent scheduling and its applications,” Operations Research, vol. 58, no. 2, pp. 458–469, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  17. J. J. Yuan, C. T. Ng, and T. C. E. Cheng, “A note on two-agent scheduling on a single machine with release dates and preemption,” Unpublished Manuscript, 2011.
  18. L. Wan, J. J. Yuan, and Z. C. Gen, “A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints,” In Submission, 2012.
  19. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, A Series of Books in the Mathematical Sciences, W. H. Freeman, San Francisco, Calif, USA, 1979. View at MathSciNet
  20. 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 Google Scholar · View at MathSciNet
  21. R. McNaughton, “Scheduling with deadlines and loss functions,” Management Science, vol. 6, pp. 1–12, 1959. View at Google Scholar · View at MathSciNet
  22. A. V. Karzanov, “Determining the maximal flow in a network by the method of preflows,” Soviet Mathematics Doklady, vol. 15, pp. 434–437, 1974. View at Google Scholar
  23. R. E. Tarjan, “A simple version of Karzanov's blocking flow algorithm,” Operations Research Letters, vol. 2, no. 6, pp. 265–268, 1984. View at Publisher · View at Google Scholar · View at MathSciNet