REFERENCES
- Biskup, D. (1999) Single machine scheduling with learning considerations. European Journal of Operational Research, 115: 173–178.
- Biskup, D. and Simons, D. (2004) Common due date scheduling with autonomous and induced learning. European Journal of Operational Research, 159: 606–616.
- Cheng, T.C.E. and Wang, G. (2000) Single machine scheduling with learning effect considerations. Annals ofOperations Research, 98: 273–290.
- Du, J. and Leung, J.Y.T. (1990) Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15: 483–495.
- Eren, T. and Güner, E. (2007) Minimizing total tardiness in a scheduling problem with a learning effect. Applied Mathematical Modelling, 31 (7): 1351–1361.
- Fox, R.L. (1971) Optimization methods for engineering design; Addision Wesley Publishing Company: London.
- Glover, F. (1986) Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 5: 533–549.
- Hsu, Y.S. and Lin, B.N.T. (2003) Minimizing of maximum lateness under linear deterioration. Omega, 31: 459–469.
- http://kartal.kku.edu.tr/~teren/
- Kuo, W.-H. and Yang, D.-L. (2006) Single-machine group scheduling with a time-dependent learning effect. Computers & Operations Research, 33: 2099–2112.
- Kuo, W.-H. and Yang, D.-L. (2006) Minimizing the makespan in a single machine scheduling problem with a time-based learning effect. Information Processing Letters, 97: 64–67.
- Kuo, W.-H. and Yang, D.-L. (2006) Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research, 174 (2): 1184–1190.
- Lee, W.-C. (2004) A note on deteriorating jobs and learning in single-machine scheduling problems. International Journal of Business and Economics, 3: 83–89.
- Lee, W.-C., Wu, C.-C. and Sung, H.-J. (2004) A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica, 40: 303–315.
- Mosheiov, G. (2001) Scheduling problems with learning effect. European Journal of Operational Research, 132: 687–693.
- Mosheiov, G. and Sidney, J.B. (2003) Scheduling with general job-dependent learning curves. European Journal of Operational Research, 147: 665–670.
- Mosheiov, G. and Sidney, J.B. (2005) Note on scheduling with general learning curves to minimize the number of tardy jobs. Journal of the Operational Research Society, 56: 110–112.
- Nawaz, M., Enscore, E.E. and Ham, I. (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11: 91–95.
- Pinedo, M.L. (1995) Scheduling: Theory, algorithms, and systems; Prentice-Hall: Englewood Cliffs, NJ.
- Su, L.H. and Chou, F.-D. (2000) Heuristic for scheduling in a two-machine bicriteria dynamic flowshop with setup and processing times separated. Production Planning & Control, 11 (8): 806–819.
- Wang, J.B. (2006) Single-machine scheduling problems with the effects of learning and deterioration. Omega, 35 (4): 397–402.
- Wang, X. and Cheng, T.C.E. (2007) Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. European Journal of Operational Research, 178 (1): 57–70.
- Wright, T.P. (1936) Factors Affecting The Cost of Airplanes. Journal of The Aeronautical Sciences, 3: 122–128.