Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2015, Article ID 932680, 4 pages
http://dx.doi.org/10.1155/2015/932680
Research Article

Two-Agent Scheduling to Minimize the Maximum Cost with Position-Dependent Jobs

School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013, China

Received 9 September 2014; Accepted 5 November 2014

Academic Editor: Chin-Chia Wu

Copyright © 2015 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. 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 · View at Scopus
  2. 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 · View at Scopus
  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 · View at Scopus
  4. D. Biskup, “Single-machine scheduling with learning considerations,” European Journal of Operational Research, vol. 115, no. 1, pp. 173–178, 1999. View at Publisher · View at Google Scholar · View at Scopus
  5. G. Mosheiov, “Scheduling problems with a learning effect,” European Journal of Operational Research, vol. 132, no. 3, pp. 687–693, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. A. Janiak and M. Y. Kovalyov, “Scheduling jobs with position-dependent processing times,” Journal of the Operational Research Society, vol. 63, no. 7, pp. 1018–1020, 2012. View at Publisher · View at Google Scholar · View at Scopus
  7. J.-B. Wang and Z.-Q. Xia, “Flow-shop scheduling with a learning effect,” Journal of the Operational Research Society, vol. 56, no. 11, pp. 1325–1330, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  8. J.-B. Wang, “Flow shop scheduling jobs with position-dependent processing times,” Journal of Applied Mathematics & Computing, vol. 18, no. 1-2, pp. 383–391, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. Y. Yin, D. Xu, K. Sun, and H. Li, “Some scheduling problems with general position-dependent and time-dependent learning effects,” Information Sciences, vol. 179, no. 14, pp. 2416–2425, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. S.-J. Yang, “Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration,” Applied Mathematics and Computation, vol. 217, no. 7, pp. 3321–3329, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. D. Biskup, “A state-of-the-art review on scheduling with learning effects,” European Journal of Operational Research, vol. 188, no. 2, pp. 315–329, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  12. P. Liu, X. Zhou, and L. Tang, “Two-agent single-machine scheduling with position-dependent processing times,” The International Journal of Advanced Manufacturing Technology, vol. 48, no. 1–4, pp. 325–331, 2010. View at Publisher · View at Google Scholar · View at Scopus
  13. L. Wan, “Two-agent pareto optimization problems with position-dependent jobs,” In press.
  14. Y. Yin, S.-R. Cheng, and C.-C. Wu, “Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties,” Information Sciences, vol. 189, pp. 282–292, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. Y. Q. Yin, W.-H. Wu, T. C. E. Cheng, and C.-C. Wu, “Single-machine scheduling with time-dependent and position-dependent deteriorating jobs,” International Journal of Computer Integrated Manufacturing, 2014. View at Publisher · View at Google Scholar
  16. Y. Yin, T. C. E. Cheng, and C.-C. Wu, “Scheduling with time-dependent processing times,” Mathematical Problems in Engineering, vol. 2014, Article ID 201421, 2 pages, 2014. View at Publisher · View at Google Scholar · View at Scopus
  17. W. E. Smith, “Various optimizers for single-stage production,” Naval Research Logistics Quarterly, vol. 3, pp. 59–66, 1956. View at Publisher · View at Google Scholar · View at MathSciNet
  18. J. A. Hoogeveen, “Single-machine scheduling to minimize a function of two or three maximum cost criteria,” Journal of Algorithms, vol. 21, no. 2, pp. 415–433, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  19. F. Sourd, “Preemptive scheduling with two minimax criteria,” Annals of Operations Research, vol. 107, pp. 303–319, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. L. Wan, L. J. Wei, J. L. Sheng, and J. J. Yuan, “Pareto optimization scheduling with two competing agents and linear non-increasing deterioration to minimize earliness penalties,” submitted.