About this Journal Submit a Manuscript Table of Contents
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 805261, 5 pages
http://dx.doi.org/10.1155/2013/805261
Research Article

Two-Agent Single-Machine Scheduling with Resource-Dependent Starting Times

School of Management, Shenyang University of Technology, Shenyang 110870, China

Received 22 May 2013; Revised 15 July 2013; Accepted 15 July 2013

Academic Editor: Yunqiang Yin

Copyright © 2013 Peng Liu and Xiaoyu Tian. 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. 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 Zentralblatt MATH · View at MathSciNet
  2. 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 Zentralblatt MATH · View at MathSciNet
  3. 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 Zentralblatt MATH · View at MathSciNet
  4. 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 Zentralblatt MATH · View at MathSciNet
  5. 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 Zentralblatt MATH · View at MathSciNet
  6. 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 Zentralblatt MATH · View at MathSciNet
  7. S. Gawiejnowicz, W. C. Lee, C. L. Lin, and C. C. Wu, “Single-machine scheduling of proportionally deteriorating jobs by two agents,” Journal of the Operational Research Society, vol. 62, no. 11, pp. 1983–1991, 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. Y. Yin, S. R. Cheng, T. C. E. Cheng, C. C. Wu, and W. H. Wu, “Two-agent single-machine scheduling with assignable due dates,” Applied Mathematics and Computation, vol. 219, no. 4, pp. 1674–1685, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  9. E. Gerstl and G. Mosheiov, “Scheduling problems with two competing agents to minimized weighted earliness-tardiness,” Computers & Operations Research, vol. 40, no. 1, pp. 109–116, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  10. T. C. E. Cheng, Y. H. Chung, S. C. Liao, and W. C. Lee, “Two-agent singe-machine scheduling with release times to minimize the total weighted completion time,” Computers & Operations Research, vol. 40, no. 1, pp. 353–361, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  11. K. Zhao and X. Lu, “Approximation schemes for two-agent scheduling on parallel machines,” Theoretical Computer Science, vol. 468, pp. 114–121, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. Y. Q. Yin, C. C. Wu, W. H. Wu, C. J. Hsu, and W. H. Wu, “A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents,” Applied Soft Computing, vol. 13, pp. 1042–1054, 2013.
  13. X. Yu, Y. Zhang, D. Xu, and Y. Yin, “Single machine scheduling problem with two synergetic agents and piece-rate maintenance,” Applied Mathematical Modelling, vol. 37, no. 3, pp. 1390–1399, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  14. W. C. Lee, Y. H. Chung, and Z. R. Huang, “A single-machine bi-criterion scheduling problem with two agents,” Applied Mathematics and Computation, vol. 219, no. 23, pp. 10831–10841, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  15. W. H. Wu, J. Y. Xu, W. H. Wu, Y. Q. Yin, I. F. Cheng, and C. C. Wu, “A tabu method for a two-agent single-machine scheduling with deterioration jobs,” Computers & Operations Research, vol. 40, no. 8, pp. 2116–2127, 2013.
  16. Q. Feng, J. J. Yuan, H. L. Liu, and C. He, “A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives,” Applied Mathematical Modelling, vol. 37, no. 10-11, pp. 7071–7076, 2013.
  17. C. C. Wu, W. H. Wu, J. C. Chen, Y. Q. Yin, and W. H. Wu, “A study of the single-machine two-agent scheduling problem with release times,” Applied Soft Computing, vol. 13, no. 2, pp. 998–1006, 2013.
  18. T. C. E. Cheng and A. Janiak, “Resource optimal control in some single-machine scheduling problems,” IEEE Transactions on Automatic Control, vol. 39, no. 6, pp. 1243–1246, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. C. L. Li, “Scheduling to minimize the total resource consumption with a constraint on the sum of completion times,” European Journal of Operational Research, vol. 80, no. 2, pp. 381–388, 1995. View at Scopus
  20. S. H. Vasilev and B. L. Foote, “On minimizing resource consumption with constraints on the makespan and the total completion time,” European Journal of Operational Research, vol. 96, no. 3, pp. 612–621, 1997. View at Scopus
  21. M. Kaspi and D. Shabtay, “Convex resource allocation for minimizing the makespan in a single machine with job release dates,” Computers & Operations Research, vol. 31, no. 9, pp. 1481–1489, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. X. Wang and T. C. E. Cheng, “Single machine scheduling with resource dependent release times and processing times,” European Journal of Operational Research, vol. 162, no. 3, pp. 727–739, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. D. Shabtay and M. Kaspi, “Parallel machine scheduling with a convex resource consumption function,” European Journal of Operational Research, vol. 173, no. 1, pp. 92–107, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. L. Yedidsion, D. Shabtay, and M. Kaspi, “A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine,” Journal of Scheduling, vol. 10, no. 6, pp. 341–352, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. D. Wang, M. Z. Wang, and J. B. Wang, “Single-machine scheduling with learning effect and resource-dependent processing times,” Computers and Industrial Engineering, vol. 59, no. 3, pp. 458–462, 2010. View at Publisher · View at Google Scholar · View at Scopus
  26. C. M. Wei, J. B. Wang, and P. Ji, “Single-machine scheduling with time-and-resource-dependent processing times,” Applied Mathematical Modelling, vol. 36, no. 2, pp. 792–798, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  27. J. B. Wang and M. Z. Wang, “Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time,” Computers & Operations Research, vol. 39, no. 3, pp. 492–497, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. J. B. Wang, M. Z. Wang, and P. Ji, “Scheduling jobs with processing times dependent on position, starting time, and allotted resource,” Asia-Pacific Journal of Operational Research, vol. 29, no. 5, Article ID 1250030, 15 pages, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. D. Wang, Y. Z. Huo, and P. Ji, “Single-machine group scheduling with deteriorating jobs and allotted resource,” Optimization Letters, 2013. View at Publisher · View at Google Scholar
  30. C. J. Hsu and D. L. Yang, “Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time,” Optimization Letters, 2013. View at Publisher · View at Google Scholar
  31. 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