Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2011, Article ID 151563, 19 pages
http://dx.doi.org/10.1155/2011/151563
Research Article

Due-Window Assignment and Scheduling with Multiple Rate-Modifying Activities under the Effects of Deterioration and Learning

1School of Management, State Key Laboratory for Mechanical Manufacturing Systems Engineering and the Key Laboratory of the Ministry of Education for Process Control and Efficiency Engineering, Xi’an Jiaotong University, Shaanxi Province, Xi'an 710049, China
2Institut Charles Delaunay, Université de Technologie de Troyes and FRE CNRS 2848, Laboratoire d'Optimisation des Systémes Industriels (LOSI), 12 rue Marie Curie, BP 2060, 10010 Troyes Cedex, France
3Laboratoire d'Informatique, Biologie Intégrative et Systèmes Complexes (IBISC), FRE CNRS 3190, Université d’Evry Val d’Essonne, 40 rue du Pelvoux, CE1455 Courcouronnes, 91020 Evry Cedex, France
4School of Economics and Management, Tongji University, Shanghai 200092, China

Received 3 September 2010; Accepted 31 January 2011

Academic Editor: Paulo Batista Gonçalves

Copyright © 2011 Zhanguo Zhu 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. T. P. Wright, “Factors affecting the cost of airplanes,” Journal of Aeronautical Sciences, vol. 3, pp. 122–128, 1936. View at Google Scholar
  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 Zentralblatt MATH
  3. T. C. E. Cheng and G. Wang, “Single machine scheduling with learning effect considerations,” Annals of Operations Research, vol. 98, pp. 273–290, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  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 Zentralblatt MATH
  5. C. Koulamas and G. J. Kyparisis, “Single-machine and two-machine flowshop scheduling with general learning functions,” European Journal of Operational Research, vol. 178, no. 2, pp. 402–407, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. J.-B. Wang, L. Sun, and L. Sun, “Single machine scheduling with a learning effect and discounted costs,” International Journal of Advanced Manufacturing Technology, vol. 49, no. 9–12, pp. 1141–1149, 2010. View at Publisher · View at Google Scholar
  7. W. H. Kuo and D. L. Yang, “Single-machine group scheduling with a time-dependent learning effect,” Computers and Operations Research, vol. 33, no. 8, pp. 2099–2112, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  8. C.-L. Lee and V.-J. Leon, “Machine scheduling with a ratemodifying activity,” European Journal of Operational Research, vol. 128, pp. 129–128, 2001. View at Google Scholar
  9. C.-L. Zhao, H.-Y. Tang, and C.-D. Cheng, “Two-parallel machines scheduling with rate-modifying activities to minimize total completion time,” European Journal of Operational Research, vol. 198, no. 1, pp. 354–357, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. E. J. Lodree, Jr. and C. D. Geiger, “A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration,” European Journal of Operational Research, vol. 201, no. 2, pp. 644–648, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. M. Ji and T. C. E. Cheng, “Scheduling with job-dependent learning effects and multiple rate-modifying activities,” Information Processing Letters, vol. 110, no. 11, pp. 460–463, 2010. View at Publisher · View at Google Scholar
  12. S.-J. Yang and D.-L. Yang, “Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities,” Computers & Mathematics with Applications, vol. 60, no. 7, pp. 2161–2169, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. 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 Publisher · View at Google Scholar · View at Scopus
  14. S. Browne and U. Yechiali, “Scheduling deteriorating jobs on a single processor,” Operations Research, vol. 38, no. 3, pp. 495–498, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. G. Mosheiov, “Scheduling jobs under simple linear deterioration,” Computers and Operations Research, vol. 21, no. 6, pp. 653–659, 1994. View at Google Scholar · View at Scopus
  16. C. T. Ng, T. C. E. Cheng, A. Bachman, and A. Janiak, “Three scheduling problems with deteriorating jobs to minimize the total completion time,” Information Processing Letters, vol. 81, no. 6, pp. 327–333, 2002. View at Publisher · View at Google Scholar
  17. G. Mosheiov, “Complexity analysis of job-shop scheduling with deteriorating jobs,” Discrete Applied Mathematics, vol. 117, no. 1–3, pp. 195–209, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  18. W. C. Lee, Y. R. Shiau, S. K. Chen, and C. C. Wu, “A two-machine flowshop scheduling problem with deteriorating jobs and blocking,” International Journal of Production Economics, vol. 124, no. 1, pp. 188–197, 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. L. Sun, L. Sun, K. Cui, and J.-B. Wang, “A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines,” European Journal of Operational Research, vol. 200, no. 1, pp. 309–311, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  20. S. Gawiejnowicz, “Scheduling deteriorating jobs subject to job or machine availability constraints,” European Journal of Operational Research, vol. 180, no. 1, pp. 472–478, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  21. M. Ji and T. C. E. Cheng, “Parallel-machine scheduling with simple linear deterioration to minimize total completion time,” European Journal of Operational Research, vol. 188, no. 2, pp. 342–347, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  22. J. B. Wang and L. Sun, “Single-machine group scheduling with linearly decreasing time-dependent setup times and job processing times,” International Journal of Advanced Manufacturing Technology, vol. 49, no. 5–8, pp. 765–772, 2010. View at Publisher · View at Google Scholar · View at Scopus
  23. W.-C. Lee, “A note on deteriorating jobs and learning in single-machine scheduling problems,” International Journal of Business and Economics, vol. 3, pp. 83–89, 2004. View at Google Scholar
  24. J.-B. Wang and T. C. E. Cheng, “Scheduling problems with the effects of deterioration and learning,” Asia-Pacific Journal of Operational Research, vol. 24, no. 2, pp. 245–261, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  25. T. C. E. Cheng, W.-C. Lee, and C.-C. Wu, “Scheduling problems with deteriorating jobs and learning effects including proportional setup times,” Computers and Industrial Engineering, vol. 58, no. 2, pp. 326–331, 2010. View at Publisher · View at Google Scholar
  26. D. L. Yang and W. H. Kuo, “Some scheduling problems with deteriorating jobs and learning effects,” Computers and Industrial Engineering, vol. 58, no. 1, pp. 25–28, 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. V. Gordon, J.-M. Proth, and C. Chu, “A survey of the state-of-the-art of common due date assignment and scheduling research,” European Journal of Operational Research, vol. 139, no. 1, pp. 1–25, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  28. D. Biskup and D. Simons, “Common due date scheduling with autonomous and induced learning,” European Journal of Operational Research, vol. 159, no. 3, pp. 606–616, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  29. S. D. Liman, S. S. Panwalkar, and S. Thongmee, “Common due window size and location determination in a single machine scheduling problem,” Journal of the Operational Research Society, vol. 49, no. 9, pp. 1007–1010, 1998. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  30. G. Mosheiov and A. Sarig, “Scheduling a maintenance activity and due-window assignment on a single machine,” Computers & Operations Research, vol. 36, no. 9, pp. 2541–2545, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  31. S.-J. Yang, D.-L. Yang, and T. C. E. Cheng, “Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance,” Computers & Operations Research, vol. 37, no. 8, pp. 1510–1514, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  32. C. Zhao and H. Tang, “A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity,” Computers and Operations Research. In press. View at Publisher · View at Google Scholar
  33. G. Mosheiov, “A-shaped policies to schedule deteriorating jobs,” Journal of the Operational Research Society, vol. 47, no. 9, pp. 1184–1191, 1996. View at Google Scholar · View at Scopus
  34. 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
  35. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, USA, 1982.
  36. P. Brucker, Scheduling Algorithms, Springer, Berlin, Germany, 3rd edition, 2001.