A note on scheduling problems with learning effect and deteriorating jobs

International Journal of Systems Science

Volumn 37, Issue 12, 2006, Pages 827-833

  Wang, J B ^a  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

Author keywords

Deteriorating jobs; Flow shop; Learning effect; Scheduling; Single machine

Indexed keywords

JOB ANALYSIS; LEARNING SYSTEMS; NUMERICAL METHODS; SCHEDULING;

DETERIORATING JOBS; FLOW SHOP; JOB PROCESSING; LEARNING EFFECTS; SINGLE MACHINE PROBLEMS;

PROBLEM SOLVING;

EID: 33749005938     PISSN: 00207721     EISSN: 14645319     Source Type: Journal    
DOI: 10.1080/00207720600879260     Document Type: Article

References (31)

1. B. Alidaee and N.K. Womer, "Scheduling with time dependent processing processing times: review and extensions", J. Oper. Res. Soc., 50, pp. 711-720, 1999.
2. A. Bachman and A. Janiak, "Minimizing Maximum Lateness under linear deterioration", Eur. J. Oper. Res., 126, pp. 557-566, 2000.
3. A. Bachman and A. Janiak, "Scheduling jobs with position-dependent processing times", J. Oper. Res. Soc., 55, pp. 257-264, 2004.
4. A. Bachman, A. Janiak and M.Y. Kovalyov, "Minimizing the total weighted completion time of deteriorating jobs", Information Proc. Lett., 81. pp. 81-84, 2002.
5. A.B. Badiru, "Computational survey of univariate and multivariate learning curve models", IEEE trans. on Eng. Manage., 39, pp. 176-188, 1992.
6. D. Biskup, "Single-machine scheduling with learning considerations", Eur. J. Oper. Res., 115, pp. 173-178, 1999.
7. S. Browne and U. Yechiali, "Scheduling deteriorating jobs on a single processor", Oper. Res., 38, pp. 495-498, 1990.
8. Z.-L. Chen, "Parallel machine scheduling with time dependent processing times", Discrete Applied Math., 70, pp. 81-94, 1996.
9. T.C.E. Cheng and Q. Ding, "The complexity of scheduling starting time dependent task with release dates", Information Processing Lett., 65, pp. 75-79, 1998.
10. T.C.E. Cheng, Q. Ding and B.M.T. Lin, "A concise survey of scheduling with time-dependent processing times", Eur. J. Oper. Res., 152, pp. 1-13, 2004.
11. 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 Math., 5, pp. 287-326, 1979.
12. J.C. Ho and J.N.D. Gupta, "Flowshop scheduling with dominant machines", Comp. and Oper. Res., 22, pp. 237-246, 1995.
13. A.S. Kunnathur and S. K. Gupta, "Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem", Eur. J. Oper. Res., 47, pp. 56-64, 1990.
14. W.-C. Lee, "A note on deteriorating jobs and learning in single-machine scheduling problems", Inter. J. Business and Economics, 3, pp. 83-89, 2004.
15. W.-C. Lee, C.-C. Wu and H.-J. Sung, "A bi-critcrion single-machine scheduling problem with learning considerations", Acta Informatica, 40, pp. 303-315, 2004.
16. G. Mosheiov, "V-shaped policies for scheduling deteriorating jobs", Oper. Res., 39, pp. 979-991, 1991.
17. G. Mosheiov, "Scheduling jobs under simple linear deterioration", Computers and Operations Research, 21, pp. 653-659, 1994.
18. G. Mosheiov, "Scheduling jobs with step-deterioration: minimizing makespan on a single- and multi-machine", Computers and Industrial Eng., 28, pp. 869-879, 1995.
19. G. Mosheiov, "Multi-machine scheduling with linear deterioration", INFOR, 36, pp. 205-214, 1998.
20. G. Mosheiov, "Scheduling problems with a learning effect", Eur. J. Oper. Res., 132, pp. 687-693, 2001.
21. G. Mosheiov, "Parallel machine scheduling with a learning effect, J. Oper. Res. Soc., 52, pp. 1165-1169, 2001.
22. G. Mosheiov, "Complexity analysis of job-shop scheduling with deteriorating jobs", Discrete Applied Math., 117, pp. 195-209, 2002.
23. G. Mosheiov and J.B. Sidney, "Scheduling with general job-dependent learning curves", Eur, J. Oper. Res., 147, pp. 665-670, 2003.
24. D.A. Nembhard and N. Osothsilp, "Task complexity effects on between-individual learning/forgetting variability", Inter. J. Industrial Ergonomics, 29, pp. 297-306, 2002.
25. C.T. Ng, T.C.E. Cheng, A. Bachman and A. Janiak, "Three scheduling problems with deteriorating jobs to minimize the total completion time", Information Processing Letters, 81, pp. 327-333, 2002.
26. Pinedo, Scheduling: Theory. Algorithms, and Systems, Upper Saddle River, NJ: Prentice-Hall, 2002.
27. P.S. Sundararaghavan and A.S. Kunnathur, "Single machine scheduling with start time dependent processing times: some solvable cases", Eur. J. Oper. Res., 78, pp. 394-403, 1994.
28. S. Xiang, G. Tang and T.C.E. Cheng, "Solvable cases of permutation flowshop scheduling with dominating machines", Int. J. Prod. Economics, 66, pp. 53-57, 2000.
29. J.-B. Wang and Z.-Q. Xia, "Flow-shop scheduling with a learning effect", J. Ope. Res. Soc:., 56, pp. 1325-1330, 2005.
30. J.-B. Wang and Z.-Q. Xia, "Flow shop scheduling with deteriorating jobs under dominating machines", Omega, 34, pp. 327-336, 2006.
31. T.P. Wright, Factors affecting the cost of airplanes, J. Aero. Sci., 3, pp. 122-128, 1936.