Skip to main content
Log in

Online scheduling to minimize total weighted (modified) earliness and tardiness cost

  • Published:
Journal of Scheduling Aims and scope Submit manuscript


We formulate a single machine online scheduling problem where jobs with distinct processing times, weights, and due dates arrive over time and must be processed one at a time without preemption in order to minimize the total weighted earliness and tardiness cost. We introduce a new scheduling policy, the list-based delayed shortest processing time (LDWSPT) policy, which is amenable to theoretical analysis. We develop lower and upper bounds on the performance of the LDWSPT policy for the minimization of total weighted (modified) earliness and tardiness cost for the case of equal earliness and tardiness costs, and then extend our results for the case when these costs are not equal. Finally, we close the optimality gap that currently exists in the literature for several variants of single machine online scheduling problems in the presence of earliness and tardiness by proving that our proposed policy is an optimal online algorithm for these variants.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others


  • Anderson, E. J. and Potts, C. N. (2004), ‘Online scheduling of a single machine to minimize total weighted completion time’, Mathematics of Operations Research 29(3), 686–697.

  • Kolliopoulos, S. G. and Steiner, G. (2007), ‘Approximation algorithms for scheduling problems with a modified total weighted tardiness objective’, Operations Research Letters 35(5), 685–692.

  • Liu, M., Xu, Y., Chu, C. and Zheng, F. (2009), ‘Online scheduling to minimize modified total tardiness with an availability constraint’, Theoretical Computer Science 410(47), 5039–5046.

  • Pruhs, K., Sgall, J. and Torng, E. ( 2004), Online scheduling, in J. Y. Leung, ed., ‘Handbook of Scheduling - Algorithms, Models, and Performance Analysis’, Chapman and Hall/CRC.

  • Sleator, D. D. and Tarjan, R. E. (1985), ‘Amortized efficiency of list update and paging rules’, Commun. ACM 28(2), 202–208.

  • Vestjens, A. ( 1997), On-line machine scheduling, PhD thesis, Department of Mathematic s and Computer Science.

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Philip M. Kaminsky.

Ethics declarations


This work was supported by a grant from the Project Production Institute.

Conflicts of interest/Competing interests:


Availability of data and material


Code availability


Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jabbari, A., Kaminsky, P.M. Online scheduling to minimize total weighted (modified) earliness and tardiness cost. J Sched 24, 431–446 (2021).

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: