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

A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms

1Business Administration Department, Fu Jen Catholic University, New Taipei City 24205, Taiwan
2Department of Healthcare Management, Yuanpei University, Hsinchu 30015, Taiwan
3Department of Business Administration and Graduate Institute of Management, Providence University, Shalu, Taichung 43301, Taiwan
4Department of Statistics, Feng Chia University, Taichung 40724, Taiwan
5Business College, Beijing Union University, Beijing 100101, China

Received 30 June 2014; Accepted 11 August 2014

Academic Editor: Chin-Chia Wu

Copyright © 2015 Shangchia Liu 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. H. Purnomo and P. Guizol, “Simulating forest plantation co-management with a multi-agent system,” Mathematical and Computer Modelling, vol. 44, no. 5-6, pp. 535–552, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. N. Bessonov, I. Demin, L. Pujo-Menjouet, and V. Volpert, “A multi-agent model describing self-renewal of differentiation effects on the blood cell population,” Mathematical and Computer Modelling, vol. 49, no. 11-12, pp. 2116–2127, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. 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 MathSciNet · View at Scopus
  4. 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 · View at Scopus
  5. 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
  6. 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
  7. T. C. 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 · View at Scopus
  8. C. T. Ng, T. C. 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 · View at Scopus
  9. T. C. 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 · View at Scopus
  10. A. Agnetis, G. de Pascale, and D. Pacciarelli, “A Lagrangian approach to single-machine scheduling problems with two competing agents,” Journal of Scheduling, vol. 12, no. 4, pp. 401–415, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. K. Lee, B. C. Choi, J. Y. 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 MathSciNet · View at Scopus
  12. J. Y. 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 · View at Scopus
  13. Y. Yin, S.-R. Cheng, T. C. 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 Zentralblatt MATH · View at MathSciNet · View at Scopus
  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. 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 Journal, vol. 13, no. 2, pp. 1042–1054, 2013. View at Publisher · View at Google Scholar · View at Scopus
  16. Q. Q. Nong, T. C. Cheng, and C. T. Ng, “Two-agent scheduling to minimize the total cost,” European Journal of Operational Research, vol. 215, no. 1, pp. 39–44, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  17. G. Wan, S. R. Vakati, J. Y. 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 MathSciNet · View at Scopus
  18. W. Luo, L. Chen, and G. Zhang, “Approximation schemes for two-machine flow shop scheduling with two agents,” Journal of Combinatorial Optimization, vol. 24, no. 3, pp. 229–239, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. 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
  20. P. Liu and L. Tang, “Two-agent scheduling with linear deteriorating jobs on a single machine,” in Computing and Combinatorics: Proceedings of the 14th Annual International Conference, COCOON 2008 Dalian, China, June 27–29, 2008, vol. 5092 of Lecture Notes in Computer Science, pp. 642–650, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  21. P. Liu, N. Yi, and X. Zhou, “Two-agent single-machine scheduling problems under increasing linear deterioration,” Applied Mathematical Modelling, vol. 35, no. 5, pp. 2290–2296, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. T. C. E. Cheng, W.-H. Wu, S.-R. Cheng, and C.-C. Wu, “Two-agent scheduling with position-based deteriorating jobs and learning effects,” Applied Mathematics and Computation, vol. 217, no. 21, pp. 8804–8824, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. T. C. 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 · View at Scopus
  24. C.-C. Wu, S.-K. Huang, and W.-C. Lee, “Two-agent scheduling with learning consideration,” Computers and Industrial Engineering, vol. 61, no. 4, pp. 1324–1335, 2011. View at Publisher · View at Google Scholar · View at Scopus
  25. D.-C. Li and P.-H. Hsu, “Solving a two-agent single-machine scheduling problem considering learning effect,” Computers and Operations Research, vol. 39, no. 7, pp. 1644–1651, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  26. Y. Yin, M. Liu, J. Hao, and M. Zhou, “Single-machine scheduling with job-position-dependent learning and time-dependent deterioration,” IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, vol. 42, no. 1, pp. 192–200, 2012. View at Publisher · View at Google Scholar · View at Scopus
  27. 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
  28. Y. 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
  29. W.-H. Wu, “Solving a two-agent single-machine learning scheduling problem,” International Journal of Computer Integrated Manufacturing, vol. 27, no. 1, pp. 20–35, 2014. View at Publisher · View at Google Scholar · View at Scopus
  30. D.-C. Li, P.-H. Hsu, and C.-C. Chang, “A genetic algorithm-based approach for single-machine scheduling with learning effect and release time,” Mathematical Problems in Engineering, vol. 2014, Article ID 249493, 12 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. S. Kirkpatrick, J. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. B.-I. Kim, S. Y. Chang, J. Chang et al., “Scheduling of raw-material unloading from ships at a steelworks,” Production Planning and Control, vol. 22, no. 4, pp. 389–402, 2011. View at Publisher · View at Google Scholar · View at Scopus
  33. Y. Sun, J. W. Fowler, and D. L. Shunk, “Policies for allocating product lots to customer orders in semiconductor manufacturing supply chains,” Production Planning and Control, vol. 22, no. 1, pp. 69–80, 2011. View at Publisher · View at Google Scholar · View at Scopus
  34. M. Nawaz, E. E. Enscore Jr., and I. Ham, “A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem,” Omega, vol. 11, no. 1, pp. 91–95, 1983. View at Publisher · View at Google Scholar · View at Scopus
  35. D. Ben-Arieh and O. Maimon, “Annealing method for PCB assembly scheduling on two sequential machines,” International Journal of Computer Integrated Manufacturing, vol. 5, no. 6, pp. 361–367, 1992. View at Publisher · View at Google Scholar