Scheduling jobs under an aging effect

Journal of the Operational Research Society

Volumn 61, Issue 6, 2010, Pages 1041-1048

  Janiak, A ^a   Rudek, R ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Aging effect; Computational analysis; Deterioration; Scheduling

Indexed keywords

COMPUTER CONTROL SYSTEMS; DETERIORATION; MACHINERY; SCHEDULING; SCHEDULING ALGORITHMS;

AGING EFFECTS; COMPUTATIONAL ANALYSIS; COMPUTER NUMERICAL CONTROL; JOB PROCESSING TIME; MAKESPAN MINIMIZATION; NON-DECREASING FUNCTIONS; POLYNOMIALLY SOLVABLE; PRODUCTION FACILITY;

JOB SHOP SCHEDULING;

EID: 77951942324     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2009.30     Document Type: Article

References (19)

1. Akturk MS, Ghosh JB and Gunes ED (2004). Scheduling with tool changes to minimize total completion time: Basic results and SPT performance. Eur J Opl Res 157: 784-790.
2. Al-Anzi FS, Allahverdi A and Kovalyov MY (2007). Batching deteriorating items with applications in computer communication and reverse logistics. Eur J Opl Res 182: 1002-1011.
3. Bachman A and Janiak A (2004). Scheduling jobs with positiondependent processing times. J Opl Res Soc 55: 257-264.
4. Chen B, Potts CN and Woeginger G (1998). A review of machine scheduling: Complexity, algorithms and approximability. In: Du DZ and Pardalos PM (eds). Handbook of Combinatorial Optimization. Kluwer: Dordrecht, pp 21-169.
5. Cheng TCE and Wang G (2000). Single machine scheduling with learning effect considerations. Ann Opns Res 98: 273-290.
6. Cheng TCE, Ding Q and Lin BMT (2004). A concise survey of scheduling with time-dependent processing times. Eur J Opl Res 152: 1-13.
7. Du J and Leung JYT (1990). Minimizaing total tardiness on one machine is NP-hard. Math Opns Res 15: 483-495.
8. Inderfurth K, Kovalyov MY, Ng CT and Werner F (2007). Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables. Int J Prod Econ 105: 345-356.
9. Janiak A and Śnieżyk A (2005). Minimizing the maximum lateness of jobs with the aging effect. In: Domek S and Kaszyski R (eds). Proceedings of 11th IEEE International Conference on Methods and Models in Automation and Robotics. Zapol: Szczecin, pp 1067-1072.
10. Kovalyov MY and Kubiak W (1997). A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. J Heuristics 20: 75-79.
11. Kuo W-H and Yang D-L (2008). Minimizing the makespan in a singlemachine scheduling problem with the cyclic process of an aging effect. J Opl Res Soc 59: 416-420.
12. Lawler EL (1977). A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness. Ann Opns Res 1: 331-342.
13. McMullen PR, Clark M, Albritton D and Bell J (2003). A correlation and heuristic approach for obtaining production sequences requiring a minimum of tool replacements. Comput Opns Res 30: 443-462.
14. Mosheiov G (1998). Multi-machine scheduling with linear deterioration. INFOR 36: 205-214.
15. Mosheiov G (2001). Parallel machine scheduling with a learning effect. J Opl Res Soc 52: 1165-1169. (Pubitemid 34191547)
16. Mosheiov G (2002). Complexity analysis of job-shop scheduling with deteriorating jobs. Disc Appl Math 117: 195-209.
17. Mosheiov G (2005). A note on scheduling deteriorating jobs. Math Comput Model 41: 883-886.
18. Papadimitrou CH and Steiglitz K (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall: Englewood Cliffs, NJ.
19. Stanford M and Lister PM (2004). Investigation into the relationship between tool-wear and cutting environments when turning EN32 steel. Ind Lubr Tribol 54: 114-121.