Scheduling problems with the effects of deterioration and learning

Asia-Pacific Journal of Operational Research

Volumn 24, Issue 2, 2007, Pages 245-261

  Wang, Ji Bo ^a   Cheng, T C Edwin ^b  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

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

Indexed keywords

FUNCTIONS; JOB ANALYSIS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; POLYNOMIALS; PROBLEM SOLVING;

DETERIORATING JOBS; FLOW SHOP PROBLEMS; LEARNING EFFECT; MACHINE PROBLEMS; SINGLE MACHINE;

SCHEDULING;

EID: 34248681860     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021759590700122X     Document Type: Conference Paper

References (35)

1. Alidaee, B and NK Womer (1999). Scheduling with time dependent processing processing times: review and extensions. Journal of the Operational Research Society, 50, 711-720.
2. Bachman, A, TCE Cheng, A Janiak and CT Ng (2002). Scheduling start time dependent jobs to minimize the total weighted completion time. Journal of the Operational Research Society, 53, 688-693.
3. Bachman, A and A Janiak (2000). Minimizing maximum lateness under linear deterioration. European Journal of Operational Research, 126, 557-566.
4. Bachman, A and A Janiak (2004). Scheduling jobs with position-dependent processing times. Journal of the Operational Research Society, 55, 257-264.
5. Bachman, A, A Janiak, and MY Kovalyov (2002). Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters, 81(2), 81-84.
6. Badiru, AB (1992). Computational survey of univariate and multivariate learning curve models. IEEE transactions on Engineering Management, 39, 176-188.
7. Biskup, D (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115, 173-178.
8. Browne, S and U Yechiali (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38, 495-498.
9. Chen, Z-L (1996). Parallel machine scheduling with time dependent processing times. Discrete Applied Mathematics, 70, 81-94.
10. Cheng, TCE and Q Ding (1998). The complexity of scheduling starting time dependent task with release dates. Information Processing Letters, 65, 75-79.
11. Cheng, TCE, Q Ding, and BMT Lin (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152, 1-13.
12. Cheng, TCE and G Wang (2000). Single machine scheduling with learning effect considerations. Annals of Operations Research 98, 273-290.
13. Graham, RL, EL Lawler, JK Lenstra and AHG Rinnooy Kan (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
14. Ho, JC and JND Gupta (1995). Flowshop scheduling with dominant machines. Computers and Operations Research, 22, 237-246.
15. Ho, KI-J, JY-T Leung and W-D Wei (1993). Complexity of scheduling tasks with time-dependent execution times. Information Processing Letters, 48, 315-320.
16. Kunnathur, AS and SK Gupta (1990). Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. European Journal of Operational Research, 47, 56-64.
17. 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.
18. Mosheiov, G (1991). V-shaped policies for scheduling deteriorating jobs. Operations Research, 39, 979-991.
19. Mosheiov, G (1994). Scheduling jobs under simple linear deterioration. Computers and Operations Research, 21, 653-659.
20. Mosheiov, G (1995). Scheduling jobs with step-deterioration: minimizing makespan on a single- and multi-machine. Computers and Industrial Engineering, 28, 869-879.
21. Mosheiov, G (1998). Multi-machine scheduling with linear deterioration. INFOR, 36, 205-214.
22. Mosheiov, G (2002). Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Applied Mathematics, 117, 195-209.
23. Mosheiov, G (2001a). Scheduling problems with a learning effect. European Journal of Operational Research, 132, 687-693.
24. Mosheiov, G (2001b). Parallel machine scheduling with a learning effect. Journal of the Operational Research Society, 52, 1165-1169.
25. Mosheiov, G and JB Sidney (2003). Scheduling with general job-dependent learning curves. European Journal of Operational Research, 147, 665-670.
26. Nembhard, DA and N Osothsilp (2002). Task complexity effects on between-individual learning/forgetting variability. International Journal of Industrial Ergonomics, 29, 297-306.
27. Ng, CT, TCE Cheng, A Bachman and A Janiak (2002). Three scheduling problems with deteriorating jobs to minimize the total completion time. Information Processing Letters, 81, 327-333.
28. Pinedo, M (2002). Scheduling: Theory, Algorithms, and Systems. Upper Saddle River, NJ: Prentice-Hall.
29. Sundararaghavan, PS and AS Kunnathur (1994). Single machine scheduling with start time dependent processing times: some solvable cases. European Journal of Operational Research, 78, 394-403.
30. Xiang, S, G Tang and TCE Cheng (2000). Solvable cases of permutation flowshop scheduling with dominating machines. International Journal of Production Economics, 66, 53-57.
31. Wang, J-B and Z-Q Xia (2005). No-wait or no-idle permutation flowshop scheduling with dominating machines. Journal of Applied Mathematics and Computing, 17, 419-432.
32. Wang, J-B and Z-Q Xia (2005). Scheduling jobs under decreasing linear deterioration. Information Processing Letters, 94, 63-69.
33. Wang, J-B and Z-Q Xia (2005). Flow-shop scheduling with a learning effect. Journal of the Operational Research Society, 56, 1325-1330.
34. Wang, J-B and Z-Q Xia (2006). Flow shop scheduling with deteriorating jobs under dominating machines. Omega, 34, 327-336.
35. Wright, TP (1936). Factors affecting the cost of airplanes. Journal of the Aeronautical Sciences, 3, 122-128.