Experience-based approach to scheduling problems with the learning effect

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans

Volumn 39, Issue 2, 2009, Pages 344-357

  Janiak, Adam ^a   Rudek, Radosław ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Computational complexity; Learning effect; Scheduling; Single processor

Indexed keywords

COMPUTATIONAL COMPLEXITY; LEARNING SYSTEMS; PLANNING; PRODUCTION CONTROL; SCHEDULING;

EXPERIENCE-BASED LEARNING; JOB PROCESSING TIME; LEARNING CURVES; LEARNING EFFECT; LEARNING MODELS; MAKESPAN MINIMIZATIONS; MANUFACTURING SYSTEMS; NP-HARD; PRODUCTION EFFICIENCIES; PRODUCTION PLANNING; RELIABLE STUDIES; SCHEDULING DOMAINS; SCHEDULING PROBLEMS; SINGLE PROCESSOR; SOLVABLE CASE; STRONGLY NP-HARD;

EDUCATION;

EID: 62149094359     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2008.2010757     Document Type: Article

References (65)

1. E. L. Thorndike, "Animal intelligence: An experimental study of the associative process in animals," Psychol. Rev. Monogr., vol. 2, no. 4, pp. 1-109, 1898.
2. L. L. Thurstone, "The learning curve equation," Psychol.Monogr., vol. 26, no. 3, pp. 1-51, 1919.
3. T. P. Wright, "Factors affecting the cost of airplanes," J. Aeronaut. Sci., vol. 3, no. 2, pp. 122-128, Feb. 1936.
4. E. C. Keachie and R. J. Fontana, "Production lot sizing under a learning effect," Manag. Sci., vol. 13, no. 2, pp. 102-108, Oct. 1966.
5. R. B. Jordan, "Learning how to use the learning curve," N.A.A. Bull., vol. 39, no. 5, pp. 27-39, 1965.
6. J. G. Carlson and R. G. Rowe, "How much does forgetting cost?" Ind. Eng., vol. 8, no. 9, pp. 40-47, Sep. 1976.
7. Y. M. Jaber and M. Bonney, "The economic manufacture/order quantity (EMQ/EOQ) and the learning curve: Past, present, and future," Int. J. Prod. Econ., vol. 59, no. 1, pp. 93-102, Mar. 1999.
8. D. Jackson, Technological Change, the Learning Curve, and Profitability. Northampton, MA: Edward Elgar, 1998.
9. L. E. Yelle, "The learning curve: Historical review and comprehensive study," Decis. Sci., vol. 10, no. 2, pp. 302-328, 1979.
10. L. Argote, "Organizational learning curves: Persistence, transfer and turnover," Int. J. Technol. Manag., vol. 11, no. 7/8, pp. 759-769, 1996.
11. J. Ariforic, G. Bullard, and J. Duffy, "The transition from stagnation to growth: An adaptive learning approach," J. Econ. Growth, vol. 2, no. 2, pp. 185-209, Jun. 1997.
12. J. Benhabib and M. M. Spiegel, "The role of human capital in economic development: Evidence from aggregate cross-country data," J. Monet. Econ., vol. 34, no. 2, pp. 143-173, 1994.
13. G. Nadler and W. D. Smith, "Manufacturing progress functions for types of processes," Int. J. Prod. Res., vol. 2, no. 2, pp. 115-135, Jun. 1963.
14. A. Young, "Learning by doing and the dynamic effects of international trade," Q. J. Econ., vol. 106, no. 2, pp. 369-405, May 1991.
15. D. Biskup, "Single-machine scheduling with learning considerations," Eur. J. Oper. Res., vol. 115, no. 1, pp. 173-178, May 1999.
16. T. C. E. Cheng and G. Wang, "Single machine scheduling with learning effect considerations," Ann. Oper. Res., vol. 98, no. 1-4, pp. 273-290, Dec. 2000.
17. G. Mosheiov, "Parallel machine scheduling with a learning effect," J. Oper. Res. Soc., vol. 52, no. 10, pp. 1-5, Oct. 2001.
18. G. Mosheiov, "Scheduling problems with a learning effect," Eur. J. Oper. Res., vol. 132, no. 3, pp. 687-693, Aug. 2001.
19. G. Mosheiov and J. B. Sidney, "Scheduling with general job-dependent learning curves," Eur. J. Oper. Res., vol. 147, no. 3, pp. 665-670, Jun. 2003.
20. W.-C. Lee, "A note on deteriorating jobs and learning in single-machine scheduling problems," Int. J. Bus. Econ., vol. 3, no. 1, pp. 83-89, 2004.
21. X. Wang and T. C. E. Cheng, "Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan," Eur. J. Oper. Res., vol. 178, no. 1, pp. 57-70, Apr. 2007.
22. J.-B. Wang and T. C. E. Cheng, "Scheduling problems with the effects of deterioration and learning," Asia-Pac. J. Oper. Res., vol. 24, no. 2, pp. 245-261, 2007.
23. J.-B. Wang, "Single-machine scheduling problems with the effects of learning and deterioration," Omega, vol. 35, no. 4, pp. 397-402, Aug. 2007.
24. M.-B. Cheng and S.-J. Sun, "The single-machine scheduling problems with deteriorating jobs and learning effect," J. Zhejiang Univ. Sci. A vol. 7, no. 4, pp. 597-601, Apr. 2006.
25. C. Koulamas and G. J. Kyparisis, "Single-machine scheduling problems with past-sequence-dependent setup times," Eur. J. Oper. Res., vol. 187, no. 3, pp. 1045-1049, Jun. 2008.
26. W.-H. Kuo and D.-L. Yang, "Single machine scheduling with past-sequence-dependent setup times and learning effects," Inf. Process. Lett., vol. 102, no. 1, pp. 22-26, Apr. 2007.
27. A. Bachman and A. Janiak, "Scheduling jobs with position-dependent processing times," J. Oper. Res. Soc., vol. 55, no. 3, pp. 257-264, Mar. 2004.
28. A. Janiak and R. Rudek, "On a general model of the learning effect," in Proc. 11th IEEE Int. Conf. Methods Models Autom. Robot., 2005, pp. 1115-1120.
29. A. Janiak and R. Rudek, "The learning effect: Getting to the core of the problem," Inf. Process. Lett., vol. 103, no. 5, pp. 183-187, Aug. 2007.
30. A. Janiak and R. Rudek, "A new approach to the learning effect: Beyond the learning curve restrictions," Comput. Oper. Res., vol. 35, no. 11, pp. 3727-3736, Nov. 2008.
31. W.-H. Kuo and D.-L. Yang, "Minimizing the makespan in a single machine scheduling problem with a time-based learning effect," Inf. Process. Lett., vol. 97, no. 2, pp. 64-67, Jan. 2006.
32. C. Koulamas and G. J. Kyparisis, "Single-machine and two-machine flowshop scheduling with general learning functions," Eur. J. Oper. Res., vol. 178, no. 2, pp. 402-407, Apr. 2007.
33. C.-C. Wu and W.-C. Lee, "Single-machine scheduling problems with a learning effect," Appl. Math. Model., vol. 32, no. 7, pp. 1191-1197, Jul. 2008.
34. W.-H. Kuo and D.-L. Yang, "Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect," Eur. J. Oper. Res., vol. 174, no. 2, pp. 1184-1190, Oct. 2006.
35. C.-C. Wu and W.-C. Lee, "A note on single-machine scheduling with learning effect and an availability constraint," Int. J. Adv. Manuf. Technol., vol. 33, no. 5/6, pp. 540-544, Jun. 2007.
36. G. Mosheiov and A. Sarig, "A due-window assignment problem with position-dependent processing times," J. Oper. Res. Soc., vol. 59, no. 7, pp. 997-1003, Jul. 2008.
37. A. Janiak and R. Rudek, "A model of query scheduling and cache management for data bases over the web," in Proc. 5th Polish-British Workshop, Comput. Syst. Eng., Theory Appl., IEE Control Autom. Professional Netw., 2006, pp. 125-134.
38. D. Biskup, "A state-of-the-art review on scheduling with learning effects," Eur. J. Oper. Res., vol. 188, no. 2, pp. 315-329, Jul. 2008.
39. T. C. E. Cheng, Q. Ding, M. Y. Kovalyov, A. Bachman, and A. Janiak, "Scheduling jobs with piecewise linear decreasing processing times," Nav. Res. Logist., vol. 50, no. 6, pp. 531-554, 2003.
40. M. D. Toksari, S. K. Işleyen, E. Güner, and O. F. Baykoç, "Simple and U-type assembly line balancing problems with a learning effect," Appl. Math. Comput., vol. 32, no. 12, pp. 2954-2961, Dec. 2008.
41. M. Ohba, "Inflexion S-shaped software reliability growth models," in Stochastic Models in Reliability Theory, Y. H. S. Osaki, Ed. Berlin, Germany: Springer-Verlag, 1984, pp. 144-162.
42. Z. Xu, L. Sun, and J. Gong, "Worst-case analysis for flow shop scheduling with a learning effect," Int. J. Prod. Econ., vol. 113, no. 2, pp. 748-753, Jun. 2008.
43. T. Eren, "A bicriteria parallel machine scheduling with a learning effect of setup and removal times," Appl. Math. Model., vol. 33, no. 2, pp. 1141-1150, Feb. 2009.
44. C. H. Papadimitrou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
45. J. K. Lenstra, A. H. G. Rinooy Kan, and P. Brucker, "Complexity of machine scheduling problems," Ann. Oper. Res., vol. 1, pp. 343-362, 1977.
46. C.-C. Wu, W.-C. Lee, and T. Chen, "Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations," Comput. Ind. Eng., vol. 52, no. 1, pp. 124-132, Feb. 2007.
47. A. Janiak and R. Rudek, "Viewpoint on: Complexity results for single-machine scheduling with positional learning effects," J. Oper. Res. Soc., vol. 59, no. 10, p. 1430, Oct. 2008.
48. B. M. T. Lin, "Complexity results for single-machine scheduling with positional learning effects," J. Oper. Res. Soc., vol. 58, no. 8, pp. 1099-1102, Aug. 2007.
49. G. Mosheiov and J. B. Sidney, "Note on scheduling with general learning curves to minimize the number of tardy jobs," J. Oper. Res. Soc., vol. 56, no. 1, pp. 110-112, Jan. 2005.
50. T. Eren and E. Güner, "Minimizing total tardiness in a scheduling problem with a learning effect," Appl. Math. Model., vol. 31, no. 7, pp. 1351-1361, Jul. 2007.
51. W.-C. Lee, C.-C. Wu, and H.-J. Sung, "A bi-criterion single-machine scheduling problem with learning considerations," Acta Inform., vol. 40, no. 4, pp. 303-315, Feb. 2004.
52. C.-C. Wu, "A makespan study of the two-machine flowshop scheduling problem with a learning effect," J. Stat. Manag. Syst., vol. 8, no. 1, pp. 13-25, 2005.
53. W.-C. Lee and C.-C. Wu, "Minimizing total completion time in a two-machine flowshop with a learning effect," Int. J. Prod. Econ. vol. 88, no. 1, pp. 85-93, Mar. 2004.
54. C.-C. Wu, W.-C. Lee, and W.-C. Wang, "A two-machine flowshop maximum tardiness scheduling problem with a learning effect," Int. J. Adv. Manuf. Technol., vol. 31, no. 7/8, pp. 743-750, Jan. 2007.
55. P. Chen, C.-C. Wu, and W.-C. Lee, "A bi-criteria two-machine flowshop scheduling problem with a learning effect," J. Oper. Res. Soc., vol. 57, no. 9, pp. 1113-1125, Sep. 2006.
56. T. Eren and E. Güner, "A bicriteria flowshop scheduling with a learning effect," Appl. Math. Model., vol. 32, no. 9, pp. 1719-1733, Sep. 2008.
57. J.-B. Wang and Z.-Q. Xia, "Flow-shop scheduling with a learning effect," J. Oper. Res. Soc., vol. 56, no. 11, pp. 1325-1330, Nov. 2005.
58. C.-C. Wu and W.-C. Lee, "A note on the total completion time problem in a permutation flowshop with a learning effect," Eur. J. Oper. Res. vol. 192, no. 1, pp. 343-347, Jan. 2009.
59. J.-B. Wang, "A note on scheduling problems with learning effect and deteriorating jobs," Int. J. Syst. Sci., vol. 37, no. 12, pp. 827-833, Oct. 2006.
60. W.-H. Kuo and D.-L. Yang, "Single-machine scheduling problems with the time-dependent learning effect," Comput. Math. Appl., vol. 53, no. 11, pp. 1733-1739, Jun. 2007.
61. J.-B. Wang, C. T. D. Ng, T. C. E. Cheng, and L. L. Liu, "Single-machine scheduling with a time-dependent learning effect," Int. J. Prod. Econ., vol. 111, no. 2, pp. 802-811, Feb. 2008.
62. W.-H. Kuo and D.-L. Yang, "Single-machine group scheduling with a time-dependent learning effect," Comput. Oper. Res., vol. 33, no. 8, pp. 2099-2112, Aug. 2006.
63. 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," Inf. Sci., vol. 178, no. 11, pp. 2476-2487, Jun. 2008.
64. T. C. E. Cheng, C.-C. Wu, and W.-C. Lee, "Some scheduling problems with deteriorating jobs and learning effects," Comput. Ind. Eng., vol. 54, no. 4, pp. 972-982, May 2008.
65. J. M. Moore, "An n jobs, one machine sequencing algorithm for minimizing the number of late jobs," Manag. Sci., vol. 15, no. 1, pp. 102-109, Sep. 1968.