Abstract
In this paper, we analyze some single machine scheduling problems with the aging effect. We extend the sum-of-processing-time-based aging model such that the fatigue caused by each job to the machine is equal to a non-increasing function dependent on the normal processing time of a job and the aging effect is job dependent. Although the proposed model is more general and describes more precisely the real-life settings, we show that the special cases of the maximum completion time and the maximum lateness minimization problems with this model are still polynomially solvable. However, we prove the maximum completion time minimization problem with the sum-of-processing-time-based aging model is strongly NP-hard if some jobs have deadlines and constant processing times. On this basis, we show that the maximum lateness minimization problem with this aging model is also strongly NP-hard.
Article PDF
Similar content being viewed by others
References
Chang PC, Chen SH, Mani V (2009) A note on due-date assignment and single machine scheduling with a learning/aging effect. Int J Prod Econ 117:142–149
Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13
Cheng TCE, Lee WC, Wu CC (2010) Single-machine scheduling with deteriorating functions for job processing times. Appl Math Model 34:4171–4178
Dababneh AJ, Swanson N, Shell RL (2001) Impact of added rest breaks on the productivity and well being of workers. Ergonomics 44:164–174
Eilon S (1964) On a mechanistic approach to fatigue and rest periods. Int J Prod Res 3:327–332
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco
Gawiejnowicz S (1996) A note on scheduling on a single processor with speed dependent on a number of executed jobs. Inf Process Lett 57:297–300
Gordon V, Potts C, Strusevich V, Whitehead J (2008) Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. J Sched 11:357–370
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326
Janiak A, Rudek R (2010) Scheduling jobs under an aging effect. J Oper Res Soc 61:1041–1048
Kuo WH, Yang DL (2008) Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect. J Oper Res Soc 59:416–420
Lai PJ, Lee WC (2011) Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects. OMEGA Int J Manage S 39:467–471
Lai PJ, Lee WC, Chen HH (2011) Scheduling with deteriorating jobs and past-sequence-dependent setup times. Int J Adv Manuf Technol 54:737–741
Lee WC, Lai PJ (2011) Scheduling problems with general effects of deterioration and learning. Inf Sci 181:1164–1170
Liu P, Zhou X, Tang L (2010) Two-agent single-machine scheduling with position-dependent processing times. Int J Adv Manuf Technol 48:325–331
Mandich NV (2003) Overview of surface preparation of metals prior to finishing: part 2. Met Finish 101:33–58
McMullen PR, Clark M, Albritton D, Bell J (2003) A correlation and heuristic approach for obtaining production sequences requiring a minimum of tool replacements. Comput Oper Res 30:443–462
Mosheiov G, Sarig A (2008) A due-window assignment problem with position-dependent processing times. J Oper Res Soc 59:997–1003
Sheikh AK, Raouf A, Sekerdey UA, Younas M (1999) Optimal tool replacement and resetting strategies in automated manufacturing systems. Int J Prod Res 37:917–937
Stanford M, Lister P (2004) Investigation into the relationship between tool-wear and cutting environments when turning EN32 steel. Ind Lubr Tribol 56:114–121
Wang JB, Wang LY, Wang D, Huang X, Wang XR (2009) A note on single-machine total completion time problem with general deteriorating function. Int J Adv Manuf Technol 44:1213–1218
Wang JB, Wang LY, Wang D, Wang XY (2009) Single-machine scheduling with a time-dependent deterioration. Int J Adv Manuf Technol 43:805–809
Yang SJ, Yang DL (2010) Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities. OMEGA Int J Manage S 38:528–533
Yang SJ, Yang DL (2010) Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities. Comput Math Appl 60:2161–2169
Yang SJ, Yang DL, Cheng T (2010) Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance. Comput Oper Res 37:1510–1514
Zhao CL, Tang HY (2010) Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan. Appl Math Model 34:837–841
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Rudek, R. Some single-machine scheduling problems with the extended sum-of-processing-time-based aging effect. Int J Adv Manuf Technol 59, 299–309 (2012). https://doi.org/10.1007/s00170-011-3481-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-011-3481-5