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

Some Single-Machine Scheduling Problems with Learning Effects and Two Competing Agents

1Mathematics Department, Zhoukou Normal University, Zhoukou 466001, China
2College of Mechanical and Electrical, Harbin Institute of Technology, Harbin 150001, China
3College of Sciences, East China Institute of Technology, Nanchang 330013, China
4Faculty of Science, Kunming University of Science and Technology, Kunming 650093, China

Received 29 April 2014; Accepted 10 May 2014; Published 25 May 2014

Academic Editor: Dar-Li Yang

Copyright © 2014 Hongjie Li 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. 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
  2. T. C. E. Cheng and G. Wang, “Single machine scheduling with learning effect considerations,” Annals of Operations Research, vol. 98, no. 1–4, pp. 273–290, 2000. View at Google Scholar · View at Scopus
  3. 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 Scopus
  4. G. Mosheiov and J. B. Sidney, “Scheduling with general job-dependent learning curves,” European Journal of Operational Research, vol. 147, no. 3, pp. 665–670, 2003. View at Publisher · View at Google Scholar · View at Scopus
  5. A. Bachman and A. Janiak, “Scheduling jobs with position-dependentprocessing times,” Journal of the Operational Research Society, vol. 55, no. 3, pp. 257–264, 2004. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Janiak and R. Rudek, “A new approach to the learning effect: beyond the learning curve restrictions,” Computers and Operations Research, vol. 35, no. 11, pp. 3727–3736, 2008. View at Publisher · View at Google Scholar · View at Scopus
  7. J.-B. Wang, “Single-machine scheduling with general learning functions,” Computers and Mathematics with Applications, vol. 56, no. 8, pp. 1941–1947, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. 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 Scopus
  9. 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 Scopus
  10. Z. Jiang, F. Chen, and H. Kang, “Single-machine scheduling problems with actual time-dependent and job-dependent learning effect,” European Journal of Operational Research, vol. 227, no. 1, pp. 76–80, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. Z. Jiang, F. Chen, and C. Wu, “Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect,” Applied Mathematics and Computation, vol. 218, no. 18, pp. 9438–9441, 2012. View at Publisher · View at Google Scholar · View at Scopus
  12. 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 Scopus
  13. S.-J. Yang and D.-L. Yang, “Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities,” Omega, vol. 38, no. 6, pp. 528–533, 2010. View at Publisher · View at Google Scholar · View at Scopus
  14. J.-B. Wang, L. Sun, and L. Sun, “Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect,” Applied Mathematical Modelling, vol. 34, no. 10, pp. 2813–2819, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. C.-C. Wu, Y. Yin, and S.-R. Cheng, “Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions,” Journal of the Operational Research Society, vol. 64, no. 1, pp. 147–156, 2013. View at Publisher · View at Google Scholar · View at Scopus
  16. D. Xu, Y. Yin, and H. Li, “Comments on “a note on minimizing maximum lateness in an m-machine scheduling problem with a learning effect”,” Applied Mathematics and Computation, vol. 217, no. 2, pp. 939–943, 2010. View at Publisher · View at Google Scholar · View at Scopus
  17. P. Liu, X. Zhou, and L. Tang, “Two-agent single-machine scheduling with position-dependent processing times,” 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
  18. K. I.-J. Ho, J. Y.-T. Leung, and W.-D. Wei, “Complexity of scheduling tasks with time-dependent execution times,” Information Processing Letters, vol. 48, no. 6, pp. 315–320, 1993. View at Publisher · View at Google Scholar · View at Scopus
  19. 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 Scopus
  20. J.-B. Wang and Z.-Q. Xia, “Scheduling jobs under decreasing linear deterioration,” Information Processing Letters, vol. 94, no. 2, pp. 63–69, 2005. View at Publisher · View at Google Scholar · View at Scopus
  21. J.-B. Wang, “A note on single-machine scheduling with decreasing time-dependent job processing times,” Applied Mathematical Modelling, vol. 34, no. 2, pp. 294–300, 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. 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 Scopus
  23. 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 Scopus
  24. A. Agnetis, D. Pacciarelli, and A. Pacifici, “Multi-agent single machine scheduling,” Annals of Operations Research, vol. 150, no. 1, pp. 3–15, 2007. View at Publisher · View at Google Scholar · View at Scopus
  25. 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 Scopus
  26. 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 Scopus
  27. 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. 386–393, 2006. View at Publisher · View at Google Scholar · View at Scopus
  28. 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 Scopus
  29. K. Lee, B.-C. Choi, J. Y.-T. Leung, and M. L. Pinedo, “Approximation algorithms for multi-agent scheduling to minimize total weighted completion time,” Information Processing Letters, vol. 109, no. 16, pp. 913–917, 2009. View at Publisher · View at Google Scholar · View at Scopus
  30. 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 Scopus
  31. G. Wan, S. R. Vakati, J. Y.-T. Leung, and M. Pinedo, “Scheduling two agents with controllable processing times,” European Journal of Operational Research, vol. 205, no. 3, pp. 528–539, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. Y. Yin, S.-R. Cheng, T. C. E. Cheng, W.-H. Wu, and C.-C. Wu, “Two-agent single-machine scheduling with release times and deadlines,” International Journal of Shipping and Transport Logistics, vol. 5, no. 1, pp. 75–94, 2013. View at Publisher · View at Google Scholar · View at Scopus
  33. 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 Scopus
  34. 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 Scopus
  35. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, “Optimization and heuristic 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 Scopus