Abstract
This paper studies the on-line production order scheduling problem where each preemption causes a penalty, and the objective is to maximize the net profit, i.e., the total weights of completed orders minus the total penalties caused by preemptions. Two greedy strategies are shown to be at best \(O(\Delta^2)\) and \((4\Delta+2\Delta\sqrt{4+1/\Delta}+1)\)-competitive respectively, where Δ is the ratio between the longest and shortest length of order. After that we mainly present an improved strategy, named WAL, which takes advantage of the knowledge of Δ and is proved to be \(\left(3\Delta + o(\Delta)\right)\)-competitive for Δ > 9. Furthermore, two lower bounds for deterministic strategies, \((1.366\Delta + 0.366)\) and 6.33, are given for the cases of nonuniform and uniform length respectively.
Similar content being viewed by others
References
Borodin A, El-yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, England
Chan WT, Lam TW, Ting HF et al (2004) New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: COCOON’04, LNCS 3106, Jeju, Korea, pp 210–218
Chou CFM (2004) Asymptotic performance ratio of an online algorithm for the single machine scheduling with release dates. IEEE Trans Autom Contr 49:772–776
Chrobak M, Jawor W, Sgall J, Tichy T (2004) Online scheduling of equal-length jobs: randomization and restarts help. In: 31st International Colloquium on Automata Languages and Programming (ICALP 2004), LNCS 3142, Turku, Finland, pp 358–370
Fung SPY, Chin FYL, Poon CK (2005) Laxity helps in broadcast scheduling. In: Proceedings of 9th Italian Conference on Theoretical Computer Science, LNCS 3701, Siena, Italy, pp 251–264
Hoogeveen H, Potts CN, Woeginger GJ (2000) On-line scheduling on a single machine: maximizing the number of early jobs. Oper Res Lett 27:193–196
Julien FO, Magazine MJ, Hall NG (1997) Generalized preemption models for single-machine dynamic scheduling problems. IIE Trans 29:359–372
Kim JH, Chwa KY (2003) Scheduling broadcasts with deadlines. In: COCOON’03, LNCS 2697, Big Sky, MT, USA, pp 415–424
Lam TW, Ngan TW, To KK (2005) A tighter extra-resource analysis of online deadline scheduling. J Combin Optim 9:157–165
Liu ZH, Cheng TCE (2004) Minimizing total completion time subject to job release dates and preemption penalties. J Sched 7:313–327
Schulz AS, Skutella M (2002) The power of α-points in preemptive single machine scheudling. J Sched 5:121–133
Smith WE (1956) Various optimizers for single-stage production. Naval Res Log Quart 3:59–66
Ting HF (2006) A near optimal scheduler for on-demand data broadcasts. 6th Italian Conference on Algorithms and Complexity, LNCS 3998, Rome, Italy, pp 163–174
Woeginger GJ (1994) On-line scheduling of jobs with fixed start and end times. Theor Computer Sci 130:5–16
Zheng FF, Fung SPY, Chan WT, Chin FYL, Poon CK, Wong PWH (2006) Improved on-line broadcast scheduling with deadlines. In: COCOON’06, LNCS 4112, Taipei, Taiwan, pp 320–329
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by NSF of China under Grants 70471035, 70525004, 70121001 and 70602031.
Rights and permissions
About this article
Cite this article
Zheng, F., Xu, Y. & Zhang, E. On-line production order scheduling with preemption penalties. J Comb Optim 13, 189–204 (2007). https://doi.org/10.1007/s10878-006-9027-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-006-9027-3