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

A Two-Agent Single-Machine Scheduling Problem with Learning and Deteriorating Considerations

Department of Healthcare Management, Yuanpei University, No. 306 Yuanpei St., Hsin Chu 30015, Taiwan

Received 26 May 2013; Accepted 1 July 2013

Academic Editor: Chin-Chia Wu

Copyright © 2013 Wen-Hsiang Wu. 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. S. Browne and U. Yechiali, “Scheduling deteriorating jobs on a single processor,” Operations Research, vol. 38, no. 3, pp. 495–498, 1990. View at Scopus
  2. 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
  3. J. N. D. Gupta and S. K. Gupta, “Single facility scheduling with nonlinear processing times,” Computers and Industrial Engineering, vol. 14, no. 4, pp. 387–393, 1988. View at Scopus
  4. B. Alidaee and N. K. Womer, “Scheduling with time dependent processing times: review and extensions,” Journal of the Operational Research Society, vol. 50, no. 7, pp. 711–720, 1999. View at Scopus
  5. T. C. E. Cheng, Q. Ding, and B. M. T. Lin, “A concise survey of scheduling with time-dependent processing times,” European Journal of Operational Research, vol. 152, no. 1, pp. 1–13, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. 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 Scopus
  7. 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
  8. J.-B. Wang, “A note on scheduling problems with learning effect and deteriorating jobs,” International Journal of Systems Science, vol. 37, no. 12, pp. 827–833, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. J.-B. Wang, “Single-machine scheduling problems with the effects of learning and deterioration,” Omega, vol. 35, no. 4, pp. 397–402, 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. X. Wang and T. C. E. Cheng, “Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan,” European Journal of Operational Research, vol. 178, no. 1, pp. 57–70, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. T. C. E. Cheng, C.-C. Wu, and W.-C. Lee, “Some scheduling problems with deteriorating jobs and learning effects,” Computers and Industrial Engineering, vol. 54, no. 4, pp. 972–982, 2008. View at Publisher · View at Google Scholar · View at Scopus
  12. 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
  13. M. D. Toksarı, D. Oron, and E. Güner, “Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning,” Mathematical and Computer Modelling, vol. 50, no. 3-4, pp. 401–406, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. X. Huang, J.-B. Wang, L.-Y. Wang, W.-J. Gao, and X.-R. Wang, “Single machine scheduling with time-dependent deterioration and exponential learning effect,” Computers and Industrial Engineering, vol. 58, no. 1, pp. 58–63, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. S.-R. Cheng, “A single-machine two-agent scheduling problem by GA approach,” Asia-Pacific Journal of Operational Research, vol. 29, no. 2, Article ID 1250013, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. D.-C. Li and P.-H. Hsu, “Solving a two-agent single-machine scheduling problem considering learning effect,” Computers & Operations Research, vol. 39, no. 7, pp. 1644–1651, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. 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 Zentralblatt MATH · View at MathSciNet
  18. 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
  19. 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
  20. J. J. Yuan, W. P. Shang, and Q. Feng, “A note on the scheduling with two families of jobs,” Journal of Scheduling, vol. 8, pp. 537–542, 2005.
  21. 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
  22. 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 Zentralblatt MATH · View at MathSciNet
  23. 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, 2012.
  24. 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
  25. P. Liu and L. Tang, “Two-agent scheduling with linear deteriorating jobs on a single machine,” in Computing and Combinatorics, vol. 5092 of Lecture Notes in Computer Science, pp. 642–650, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. T. C. E. Cheng, S.-R. Cheng, W.-H. Wu, P.-H. Hsu, and C.-C. Wu, “A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations,” Computers and Industrial Engineering, vol. 60, no. 4, pp. 534–541, 2011. View at Publisher · View at Google Scholar · View at Scopus
  27. C. C. Wu, S. K. Huang, and W. C. Lee, “Two-agent scheduling with learning consideration,” Computers & Industrial Engineering, vol. 61, no. 4, pp. 1324–1335, 2011.
  28. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, “Optimization by simulated annealing,” American Association for the Advancement of Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. R. Stahlbock and S. Voß, “Efficiency considerations for sequencing and scheduling of double-rail-mounted gantry cranes at maritime container terminals,” International Journal of Shipping and Transport Logistics, vol. 2, no. 1, pp. 95–123, 2010. View at Publisher · View at Google Scholar · View at Scopus
  30. C.-L. Li and K.-W. Pang, “An integrated model for ship routing and berth allocation,” International Journal of Shipping and Transport Logistics, vol. 3, no. 3, pp. 245–260, 2011. View at Publisher · View at Google Scholar · View at Scopus
  31. 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
  32. D. Ben-Arieh and O. Maimon, “Annealing method for PCB assembly scheduling on two sequential machines,” International Journal of Computer Integrated Manufacturing, vol. 5, pp. 361–367, 1992.
  33. M. L. Fisher, “A dual algorithm for the one-machine scheduling problem,” Mathematical Programming, vol. 11, no. 3, pp. 229–251, 1976/77. View at Publisher · View at Google Scholar · View at MathSciNet