Abstract
Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations that the processing time increases (deteriorates) as the start time increases. Examples include scheduling cleaning or maintenance, fire fighting, steel production and financial management. Scheduling of deteriorating jobs was first introduced on a single machine by Browne and Yechiali, and Gupta and Gupta independently. In particular, lots of work has been devoted to jobs with linear deterioration. The processing time p j of job J j is a linear function of its start time s j , precisely, p j = a j + b j s j , where a j is the normal or basic processing time and b j is the deteriorating rate. The objective is to minimize the makespan of the schedule.
We first consider simple linear deterioration, i.e., p j = b j s j . It has been shown that on m parallel machines, in the online-list model, LS (List Scheduling) is \((1+b_{\rm max})^{1-\frac{1}{m}}\)-competitive. We extend the study to the online-time model where each job is associated with a release time. We show that for two machines, no deterministic online algorithm is better than (1 + b max)-competitive, implying that the problem is more difficult in the online-time model than in the online-list model. We also show that LS is \((1+b_{\rm max})^{2(1-\frac{1}{m})}\)-competitive, meaning that it is optimal when m = 2.
This work is partially supported by NSF of China under Grants 71071123, 60736027 and 71101106. The work is partly done while Sheng Yu was at Xi’an Jiaotong University and was visiting University of Liverpool.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alidaee, B., Womer, N.K.: Scheduling with time dependent processing times: Review and extensions. J. of Operational Research Society 50(7), 711–720 (1999)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Browne, S., Yechiali, U.: Scheduling deteriorating jobs on a single processor. Operations Research 38(3), 495–498 (1990)
Cheng, M.B., Sun, S.J.: A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs. Journal of Shanghai University 11(5), 451–456 (2007)
Cheng, T.C.E., Ding, Q.: The complexity of single machine scheduling with release times. Information Processing Letters 65(2), 75–79 (1998)
Cheng, T.C.E., Ding, Q., Lin, B.M.T.: A concise survey of scheduling with time-dependent processing times. European J. of OR 152(1), 1–13 (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Gawiejnowicz, S.: Scheduling deteriorating jobs subject to job or machine availability constraints. European J. of OR 180(1), 472–478 (2007)
Gawiejnowicz, S.: Time-Dependent Scheduling. Springer, Berlin (2008)
Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45(9), 1563–1581 (1966)
Gupta, J.N.D., Gupta, S.K.: Single facility scheduling with nonlinear processing times. Computers and Industrial Engineering 14(4), 387–393 (1988)
Ji, M., He, Y., Cheng, T.C.E.: Scheduling linear deteriorating jobs with an availability constraint on a single machine. Theoretical Computer Science 362(1-3), 115–126 (2006)
Kang, L.Y., Ng, C.T.: A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs. International Journal of Production Economics 109(1-2), 108–184 (2007)
Kononov, A.: Scheduling problems with linear increasing processing times. In: Zimmermann, U., et al. (eds.) Operations Research Proceedings 1996, Berlin, pp. 208–212 (1997)
Kunnathur, A.S., Gupta, S.K.: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. European Journal of Operation Research 47(1), 56–64 (1990)
Lee, C.Y.: Machine scheduling with an availability constraint. Journal of Global Optimization 9(3-4), 395–416 (1996)
Lee, C.Y.: Machine scheduling with availability constraints. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, pp. 22.1–22.13. Chapman and Hall, Boca Raton (2004)
Lee, C.Y., Lei, L., Pinedo, M.: Current trend in deterministic scheduling. Annals of Operations Research 70, 1–42 (1997)
Lee, W., Wu, C., Chung, Y.: Scheduling deteriorating jobs on a single machine with release times. Computers and Industrial Engineering 54(3), 441–452 (2008)
Mosheiov, G.: V-shaped policies for scheduling deteriorating jobs. Operations Research 39, 979–991 (1991)
Mosheiov, G.: Scheduling jobs under simple linear deterioration. Computers and Operations Research 21(6), 653–659 (1994)
Mosheiov, G.: Multi-machine scheduling with linear deterioration. INFOR: Information Systems and Operational Research 36(4), 205–214 (1998)
Ng, C.T., Li, S.S., Cheng, T.C.E., Yuan, J.J.: Preemptive scheduling with simple linear deterioration on a single machine. Theoretical Computer Science 411(40-42), 3578–3586 (2010)
Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Upper Saddle River (2002)
Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, pp, 15.1–15.42. Chapman and Hall, Boca Raton (2004)
Ren, C.R., Kang, L.Y.: An approximation algorithm for parallel machine scheduling with simple linear deterioration. Journal of Shanghai University 11(4), 351–354 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, S., Ojiaku, JT., Wong, P.W.H., Xu, Y. (2012). Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines. In: Agrawal, M., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2012. Lecture Notes in Computer Science, vol 7287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29952-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-29952-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29951-3
Online ISBN: 978-3-642-29952-0
eBook Packages: Computer ScienceComputer Science (R0)