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

Minimizing Total Weighted Completion Time on Single Machine with Past-Sequence-Dependent Setup Times and Exponential Time-Dependent and Position-Dependent Learning Effects

School of Electronic and Information Engineering, Dalian University of Technology, Dalian 116024, China

Received 13 May 2009; Revised 29 August 2009; Accepted 17 September 2009

Academic Editor: Stevo Stević

Copyright © 2009 Kaibiao Sun and Hongxing Li. 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. B. Badiru, “Computational survey of univariate and multivariate learning curve models,” IEEE Transactions on Engineering Management, vol. 39, no. 2, pp. 176–188, 1992. View at Publisher · View at Google Scholar · 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. 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
  4. 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
  5. G. Mosheiov, “Parallel machine scheduling with a learning effect,” Journal of the Operational Research Society, vol. 52, no. 10, pp. 1165–1169, 2001. View at Google Scholar · View at Scopus
  6. 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 · View at MathSciNet
  7. 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
  8. J.-B. Wang, “A note on scheduling problems with learning effects and deteriorating jobs,” International Journal of Systems Science, vol. 37, no. 12, pp. 827–833, 2006. 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. T. Eren and E. Güner, “Minimizing total tardiness in a scheduling problem with a learning effect,” Applied Mathematical Modelling, vol. 31, no. 7, pp. 1351–1361, 2007. View at Publisher · View at Google Scholar · View at Scopus
  11. B. M. T. Lin, “Complexity results for single-machine scheduling with positional learning effects,” Journal of the Operational Research Society, vol. 58, no. 8, pp. 1099–1102, 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. 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
  13. C.-C. Wu, W.-C. Lee, and T. Chen, “Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations,” Computers & Industrial Engineering, vol. 52, no. 1, pp. 124–132, 2007. View at Publisher · View at Google Scholar · View at Scopus
  14. W.-H. Kuo and D.-L. Yang, “Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect,” European Journal of Operational Research, vol. 174, no. 2, pp. 1184–1190, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. W.-H. Kuo and D.-L. Yang, “Single-machine group scheduling with a time-dependent learning effect,” Computers & Operations Research, vol. 33, no. 8, pp. 2099–2112, 2006. View at Publisher · View at Google Scholar · View at Scopus
  16. W.-H. Kuo and D.-L. Yang, “Single-machine scheduling problems with time-dependent learning effect,” Computers & Mathematics with Applications, vol. 53, no. 11, pp. 1733–1739, 2007. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. J.-B. Wang, C. T. Ng, T. C. E. Cheng, and L. L. Liu, “Single-machine scheduling with a time-dependent learning effect,” International Journal of Production Economics, vol. 111, no. 2, pp. 802–811, 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. 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 · View at MathSciNet
  19. C.-C. Wu and W.-C. Lee, “Single-machine scheduling problems with a learning effect,” Applied Mathematical Modelling, vol. 32, no. 7, pp. 1191–1197, 2008. View at Google Scholar · View at MathSciNet
  20. T. C. E. Cheng, C.-C. Wu, and W.-C. Lee, “Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects,” Information Sciences, vol. 178, no. 11, pp. 2476–2487, 2008. View at Google Scholar · View at MathSciNet
  21. 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
  22. A. Allahverdi, J. N. D. Gupta, and T. Aldowaisan, “A review of scheduling research involving setup considerations,” Omega, vol. 27, no. 2, pp. 219–239, 1999. View at Publisher · View at Google Scholar · View at Scopus
  23. A. Allahverdi, C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov, “A survey of scheduling problems with setup times or costs,” European Journal of Operational Research, vol. 187, no. 3, pp. 985–1032, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. C. Koulamas and G. J. Kyparisis, “Single-machine scheduling problems with past-sequence-dependent setup times,” European Journal of Operational Research, vol. 187, no. 3, pp. 1045–1049, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. W.-H. Kuo and D.-L. Yang, “Single machine scheduling with past-sequence-dependent setup times and learning effects,” Information Processing Letters, vol. 102, no. 1, pp. 22–26, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  26. J.-B. Wang, “Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect,” Computers & Industrial Engineering, vol. 55, no. 3, pp. 584–591, 2008. View at Publisher · View at Google Scholar · View at Scopus
  27. D. Biskup and J. Herrmann, “Single-machine scheduling against due dates with past-sequence-dependent setup times,” European Journal of Operational Research, vol. 191, no. 2, pp. 586–591, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. J.-B. Wang, D. Wang, L.-Y. Wang, L. Lin, N. Yin, and W.-W. Wang, “Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times,” Computers & Mathematics with Applications, vol. 57, no. 1, pp. 9–16, 2009. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. D.-L. Yang and W.-H. Kuo, “Single-machine scheduling with an actual time-dependent learning effect,” Journal of the Operational Research Society, vol. 58, no. 10, pp. 1348–1353, 2007. View at Publisher · View at Google Scholar · View at Scopus
  30. 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 · View at MathSciNet