Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect

Applied Mathematical Modelling

Volumn 34, Issue 10, 2010, Pages 2813-2819

  Wang, Ji Bo ^a,b   Sun, Linhui ^b,c   Sun, Linyan ^b  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

^b XI'AN JIAOTONG UNIVERSITY   (China)

^c XI'AN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Learning effect; Scheduling; Single machine

Indexed keywords

EXPONENT FUNCTION; EXPONENTIAL SUMS; LEARNING EFFECT; LEARNING EFFECTS; MAKESPAN; MAKESPAN MINIMIZATION; MAXIMUM LATENESS; MINIMIZATION PROBLEMS; OBJECTIVE FUNCTIONS; POLYNOMIAL-TIME; PROCESSING TIME; QUADRATIC JOB COMPLETION TIME; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE MACHINES; SINGLE-MACHINE SCHEDULING; TOTAL COMPLETION TIME; TOTAL WEIGHTED COMPLETION TIME;

ALGEBRA; MACHINERY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SCHEDULING; SCHEDULING ALGORITHMS;

EXPONENTIAL FUNCTIONS;

EID: 77952887957     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2009.12.015     Document Type: Article

References (26)

1. Badiru A.B. Computational survey of univariate and multivariate learning curve models. IEEE Trans. Eng. Manage. 1992, 39:176-188.
2. Biskup D. Single-machine scheduling with learning considerations. Eur. J. Oper. Res. 1999, 115:173-178.
3. Cheng T.C.E., Wang G. Single machine scheduling with learning effect considerations. Ann. Oper. Res. 2000, 98:273-290.
4. Wright T.P. Factors affecting the cost of airplanes. J. Aeronaut. Sci. 1936, 3:122-128.
5. Mosheiov G. Scheduling problems with a learning effect. Eur. J. Oper. Res. 2001, 132:687-693.
6. Mosheiov G. Parallel machine scheduling with a learning effect. J. Oper. Res. Soc. 2001, 52:1165-1169.
7. Lee W.-C., Wu C.-C. Minimizing total completion time in a two-machine flowshop with a learning effect. Int. J. Prod. Econ. 2004, 88:85-93.
8. Lee W.-C., Wu C.-C., Sung H.-J. A bi-criterion single-machine scheduling problem with learning considerations. Acta Inform. 2004, 40:303-315.
9. Wang J.-B., Xia Z.-Q. Flow-shop scheduling with a learning effect. J. Oper. Res. Soc. 2005, 56:1325-1330.
10. Wang J.-B. Flow shop scheduling jobs with position-dependent processing times. J. Appl. Math. Comput. 2005, 18:383-391.
11. Pegels C.C. On startup or learning curves: an expanded view. AIIE Trans. 1969, 1:316-322.
12. Mosheiov G., Sidney J.B. Scheduling with general job-dependent learning curves. Eur. J. Oper. Res. 2003, 147:665-670.
13. Biskup D., Simons D. Common due date scheduling with autonomous and induced learning. Eur. J. Oper. Res. 2004, 159:606-616.
14. Kuo W.-H., Yang D.-L. Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. Eur. J. Oper. Res. 2006, 174:1184-1190.
15. Kuo W.-H., Yang D.-L. Single-machine group scheduling with a time-dependent learning effect. Comput. Oper. Res. 2006, 33:2099-2112.
16. Eren T., Guner E. A bicriteria scheduling with a learning effect: total completion time and total tardiness. INFOR 2007, 45:75-81.
17. Eren T., Guner E. Minimizing total tardiness in a scheduling problem with a learning effect. Appl. Math. Model. 2007, 31:1351-1361.
18. Wang J.-B., Ng C.T., Cheng T.C.E., Liu L.L. Single-machine scheduling with a time-dependent learning effect. Int. J. Product. Econ. 2008, 111:802-811.
19. Kuolamas C., Kyparisis G.J. Single-machine and two-machine flowshop scheduling with general learning functions. Eur. J. Oper. Res. 2007, 178:402-407.
20. Eren T. A bicriteria parallel machine scheduling with a learning effect of setup and removal times. Appl. Math. Model. 2009, 33:1141-1150.
21. Wang J.-B., Wang D., Wang L.-Y., Lin L., Yin N., Wang W.-W. Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times. Comput. Math. Appl. 2009, 57:9-16.
22. Cheng T.C.E., Lai P.-J., Wu C.-C., Lee W.-C. Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations. Inform. Sci. 2009, 179:3127-3135.
23. Bachman A., Janiak A. Scheduling jobs with position-dependent processing times. J. Oper. Res. Soc. 2004, 55:257-264.
24. Biskup D. A state-of-the-art review on scheduling with learning effects. Eur. J. Oper. Res. 2008, 188:315-329.
25. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 1979, 5:287-326.
26. Townsend W. The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manage. Sci. 1978, 24:530-534.