Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015 (2015), Article ID 452602, 9 pages
http://dx.doi.org/10.1155/2015/452602
Research Article

Note on a Single-Machine Scheduling Problem with Sum of Processing Times Based Learning and Ready Times

1Department of Business Administration, Fu Jen Catholic University, New Taipei City 24205, Taiwan
2Department of Statistics, Feng Chia University, Taichung 40724, Taiwan

Received 5 September 2014; Accepted 20 January 2015

Academic Editor: Chuangxia Huang

Copyright © 2015 Shang-Chia 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. 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, pp. 273–290, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. 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 MathSciNet · View at Scopus
  4. 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 Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. T. Eren and E. Güner, “A bicriteria flowshop scheduling with a learning effect,” Applied Mathematical Modelling, vol. 32, no. 9, pp. 1719–1733, 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. T. Eren and E. Güner, “A bicriteria parallel machine scheduling with a learning effect,” International Journal of Advanced Manufacturing Technology, vol. 40, no. 11-12, pp. 1202–1205, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. T. Eren, “A note on minimizing maximum lateness in an m-machine scheduling problem with a learning effect,” Applied Mathematics and Computation, vol. 209, no. 2, pp. 186–190, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. A. Janiak and R. Rudek, “A note on the learning effect in multi-agent optimization,” Expert Systems with Applications, vol. 38, no. 5, pp. 5974–5980, 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. 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 MathSciNet · View at Scopus
  10. M. D. Toksari and E. Güner, “The common due-date early/tardy scheduling problem on a parallelmachine under the effects of time-dependent learning and linear and nonlinear deterioration,” Expert Systems with Applications, vol. 37, no. 1, pp. 92–112, 2010. View at Publisher · View at Google Scholar · View at Scopus
  11. J.-B. Wang and L.-L. Liu, “Two-machine flow shop problem with effects of deterioration and learning,” Computers & Industrial Engineering, vol. 57, no. 3, pp. 1114–1121, 2009. View at Publisher · View at Google Scholar · View at Scopus
  12. 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
  13. 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 MathSciNet · View at Scopus
  14. Y. Yin, D. Xu, and J. Wang, “Some single-machine scheduling problems with past-sequence-dependent setup times and a general learning effect,” The International Journal of Advanced Manufacturing Technology, vol. 48, no. 9–12, pp. 1123–1132, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. Y. Yin, D. Xu, and J. Wang, “Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect,” Applied Mathematical Modelling, vol. 34, no. 11, pp. 3623–3630, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. Y. Yin and D. Xu, “Some single-machine scheduling problems with general effects of learning and deterioration,” Computers and Mathematics with Applications, vol. 61, no. 1, pp. 100–108, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. 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: Systems, vol. 42, no. 1, pp. 192–200, 2012. View at Publisher · View at Google Scholar · View at Scopus
  18. C.-C. Wu, Y. Yin, and S.-R. Cheng, “Some single-machine scheduling problems with a truncation learning effect,” Computers & Industrial Engineering, vol. 60, no. 4, pp. 790–795, 2011. View at Publisher · View at Google Scholar · View at Scopus
  19. C.-C. Wu, Y. Yin, W.-H. Wu, and S.-R. Cheng, “Some polynomial solvable single-machine scheduling problems with a truncation sum-of-processing-times based learning effect,” European Journal of Industrial Engineering, vol. 6, no. 4, pp. 441–453, 2012. View at Google Scholar · View at Scopus
  20. 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
  21. J.-B. Wang, M.-Z. Wang, and P. Ji, “Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs,” International Journal of Systems Science, vol. 43, no. 5, pp. 861–868, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. J.-B. Wang, Y.-B. Wu, and P. Ji, “A revision of some single-machine and m-machine flowshop scheduling problems with learning considerations,” Information Sciences, vol. 190, pp. 227–232, 2012. View at Publisher · View at Google Scholar
  23. J.-B. Wang, X.-Y. Wang, L.-H. Sun, and L.-Y. Sun, “Scheduling jobs with truncated exponential learning functions,” Optimization Letters, vol. 7, no. 8, pp. 1857–1873, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. J. Bai, M.-Z. Wang, and J.-B. Wang, “Single machine scheduling with a general exponential learning effect,” Applied Mathematical Modelling, vol. 36, no. 2, pp. 829–835, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. B. Vahedi-Nouri, P. Fattahi, and R. Ramezanian, “Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints,” Journal of Manufacturing Systems, vol. 32, no. 1, pp. 167–173, 2013. View at Publisher · View at Google Scholar
  26. Y.-Y. Lu, G. Li, Y.-B. Wu, and P. Ji, “Optimal due-date assignment problem with learning effect and resource-dependent processing times,” Optimization Letters, vol. 8, no. 1, pp. 113–127, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. 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
  28. W.-C. Lee, C.-C. Wu, and M.-F. Liu, “A single-machine bi-criterion learning scheduling problem with release times,” Expert Systems with Applications, vol. 36, no. 7, pp. 10295–10303, 2009. View at Publisher · View at Google Scholar · View at Scopus
  29. T. Eren, “Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect,” Applied Mathematics and Computation, vol. 208, no. 2, pp. 355–358, 2009. View at Publisher · View at Google Scholar · View at Scopus
  30. W.-C. Lee, C.-C. Wu, and P.-H. Hsu, “A single-machine learning effect scheduling problem with release times,” Omega, vol. 38, no. 1-2, pp. 3–11, 2010. View at Publisher · View at Google Scholar · View at Scopus
  31. C.-C. Wu and C.-L. Liu, “Minimizing the makespan on a single machine with learning and unequal release times,” Computers & Industrial Engineering, vol. 59, no. 3, pp. 419–424, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. C. C. Wu, P. H. Hsu, and K. Lai, “Simulated-annealing heuristics for the single-machine scheduling problem with learning and unequal job release times,” Journal of Manufacturing Systems, vol. 30, no. 1, pp. 54–62, 2011. View at Publisher · View at Google Scholar · View at Scopus
  33. C.-C. Wu, P.-H. Hsu, J.-C. Chen, N.-S. Wang, and W.-H. Wu, “Branch-and-bound and simulated annealing algorithms for a total weighted completion time scheduling with ready times and learning effect,” International Journal of Advanced Manufacturing Technology, vol. 55, no. 1–4, pp. 341–353, 2011. View at Publisher · View at Google Scholar · View at Scopus
  34. C.-C. Wu, P.-H. Hsu, J.-C. Chen, and N.-S. Wang, “Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times,” Computers and Operations Research, vol. 38, no. 7, pp. 1025–1034, 2011. View at Publisher · View at Google Scholar · View at Scopus
  35. J.-B. Wang and J.-J. Wang, “Single machine group scheduling with time dependent processing times and ready times,” Information Sciences, vol. 275, pp. 226–231, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. M. M. Dessouky, “Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness,” Computers and Industrial Engineering, vol. 34, no. 4, pp. 793–806, 1998. View at Publisher · View at Google Scholar · View at Scopus
  37. 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 MathSciNet · View at Scopus
  38. J.-S. Chen, J. C.-H. Pan, and C.-M. Lin, “Solving the reentrant permutation flow-shop scheduling problem with a hybrid genetic algorithm,” International Journal of Industrial Engineering : Theory Applications and Practice, vol. 16, no. 1, pp. 23–31, 2009. View at Google Scholar · View at Scopus
  39. J. Liu and B. L. MacCarthy, “Effective heuristics for the single machine sequencing problem with ready times,” International Journal of Production Research, vol. 29, no. 8, pp. 1521–1533, 1991. View at Publisher · View at Google Scholar · View at Scopus
  40. C. Reeves, “Heuristics for scheduling a single machine subject to unequal job release times,” European Journal of Operational Research, vol. 80, no. 2, pp. 397–403, 1995. View at Publisher · View at Google Scholar · View at Scopus