Skip to main content

Advertisement

Springer Nature Link
Log in

Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Gafarov et al. (Ann Oper Res 196(1):247–261, 2012) have recently presented an \(O(n^2)\) time dynamic programming algorithm for a single machine scheduling problem to maximize the total job tardiness. We reduce this problem in \(O(n\log n)\) time to a problem of unconstrained minimization of a function of 0–1 variables, called half-product, for which a simple \(O(n^2)\) time dynamic programming algorithm is known in the literature.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  • Aloulou, M. A., Kovalyov, M. Y., & Portmann, M.-C. (2004). Maximization problems in single machine scheduling. Annals of Operations Research, 129(1–4), 21–32.

    Article  Google Scholar 

  • Aloulou, M. A., Kovalyov, M. Y., & Portmann, M.-C. (2007). Evaluating flexible solutions in single machine scheduling via objective function maximization: The study of computational complexity. RAIRO Operations Research, 41(1), 1–18.

    Article  Google Scholar 

  • Badics, T., & Boros, E. (1998). Minimization of half-products. Mathematics of Operations Research, 23(3), 649–660.

    Article  Google Scholar 

  • Can, A., & Ulusoy, G. (2014). Multi-project scheduling with two-stage decomposition. Annals of Operations Research, 217(1), 95–116.

    Article  Google Scholar 

  • Erel, E., & Ghosh, J. B. (2008). FPTAS for half-products minimization with scheduling applications. Discrete Applied Mathematics, 156(15), 3046–3056.

    Article  Google Scholar 

  • Gafarov, E. R., Lazarev, A. A., & Werner, F. (2012). Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one. Annals of Operations Research, 196(1), 247–261.

    Article  Google Scholar 

  • Gafarov, E. R., Lazarev, A. A., & Werner, F. (2013). Single machine total tardiness maximization problems: Complexity and algorithms. Annals of Operations Research, 207(1), 121–136.

    Article  Google Scholar 

  • Gawiejnowicz, S., & Kononov, A. (2014). Isomorphic scheduling problems. Annals of Operations Research, 213(1), 131–145.

    Article  Google Scholar 

  • Hashemian, N., Diallo, C., & Vizvári, B. (2014). Makespan minimization for parallel machines scheduling with multiple availability constraints. Annals of Operations Research, 213(1), 173–186.

    Article  Google Scholar 

  • Janiak, A., Kovalyov, M. Y., Kubiak, W., & Werner, F. (2005). Positive half-products and scheduling with controllable processing times. European Journal of Operational Research, 165(2), 416–422.

    Article  Google Scholar 

  • Jurisch, B., Kubiak, W., & Jozefowska, J. (1997). Algorithms for minclique scheduling problems. Discrete Applied Mathematics, 72(1–2), 115–139.

    Article  Google Scholar 

  • Kellerer, H., & Strusevich, V. (2012). The symmetric quadratic knapsack problem: Approximation and scheduling applications. 4OR—A Quarterly Journal of Operations Research, 10(2), 111–161.

    Article  Google Scholar 

  • Kellerer, H., & Strusevich, V. (2013). Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product. European Journal of Operational Research, 228(1), 24–32.

    Article  Google Scholar 

  • Keshavarz, T., Salmasi, N., & Varmazyar, M. (2014). Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem. Annals of Operations Research, 226(1), 351–377.

  • Kovalyov, M. Y., & Kubiak, W. (2012). A generic FPTAS for partition type optimization problems. International Journal of Planning and Scheduling, 1(3), 209–233.

    Article  Google Scholar 

  • Kubiak, W. (1995). New results on the completion time variance minimization. Discrete Applied Mathematics, 58(2), 157–168.

    Article  Google Scholar 

  • Kubiak, W. (2005). Minimization of ordered, symmetric half-products. Discrete Applied Mathematics, 146(3), 287–300.

    Article  Google Scholar 

  • Lawler, E. L., & Moore, J. M. (1969). A functional equation and its application to resource allocation and sequencing problems. Management Science, 16(1), 77–84.

    Article  Google Scholar 

  • St. John, R., & Tóth, S. F. (2014). Spatially explicit forest harvest scheduling with difference equations. Annals of Operations Research, 232(1), 235–257.

  • Xu, Z. (2012). A strongly polynomial FPTAS for the symmetric quadratic knapsack problem. European Journal of Operational Research, 218(2), 377–381.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INSEEC Business School, ECE Lyon, 25 rue de l’Université, 69007 , Lyon, France

    Sergey Kovalev

Authors
  1. Sergey Kovalev
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Sergey Kovalev.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kovalev, S. Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization. Ann Oper Res 235, 815–819 (2015). https://doi.org/10.1007/s10479-015-2023-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-015-2023-1

Keywords