Amortized efficiency of list update and paging rules
Communications of the ACM
Scheduling with job release dates, delivery times and preemption penalties
Information Processing Letters
Single machine scheduling with a variable common due date and resource-dependent processing times
Computers and Operations Research
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
Mathematics of Operations Research
An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling
Journal of Scheduling
Mathematical Programming: Series A and B
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
SIAM Journal on Computing
Lower bounds on online deadline scheduling with preemption penalties
Information Processing Letters
An Optimal Strategy for Online Non-uniform Length Order Scheduling
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Online preemptive scheduling with immediate decision or notification and penalties
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Online scheduling with preemption or non-completion penalties
Journal of Scheduling
Hi-index | 0.00 |
In this paper we study the on-line production order disposal problem considering preemption and abortion penalty. We discuss the cases when orders have uniform and nonuniform lengths. For the case of uniform order length, the GR strategy is proved to be $2\rho + 2\sqrt{(1+\rho)^2 + \rho + 3}$ -competitive, where ρ ≥ 0 is the coefficient of the punishment. For the case of nonuniform order lengths, GR is $2(\lambda + \lambda\rho) + 2\sqrt{(\lambda+\lambda\rho)^2 + \lambda\rho + 1}$ -competitive where λ is the ratio of length between the longest and shortest orders. When abortion penalty is not counted, the ER strategy is proposed and proved to be eλ + e + 1 -competitive, where e ≈ 2.718. The result is much better than that of GR. We show that ER is not competitive when abortion penalty is counted.