Skip to main content
SpringerLink
Log in

Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine

  • Mathematics
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. J. Du and J. Y.-T. Leung, Math. Oper. Res., No. 15, 483–495 (1990).

  2. E. L. Lawler, Ann. Discrete Math., No. 1, 331–342 (1977).

  3. W. Szwarc, A. Grosso, and F. Della Croce, J. Scheduling, No. 4, 93–104 (2001).

  4. C. N. Potts and L. N. van Wassenhove, Oper. Res. Lett., No. 1, 177–182 (1982).

  5. F. Della Croce, A. Grosso, and V. Paschos, J. Scheduling, No. 7, 85–91 (2004).

  6. A. Lazarev, A. Kvaratskhelia, and A. Tchernykh, in Proceedings of the ENC’04 International Conference (Colima, Mexico, 2004) (Colima, 2004), pp. 474–480.

  7. A. A. Lazarev and E. R. Gafarov, Izv. Ross. Akad. Nauk Teor. Sist. Upr., No. 3, 120–128 (2006).

Download references

Author information

Authors and Affiliations

  1. Computer Center, Russian Academy of Sciences, ul. Vavilova 40, GSP-1, Moscow, 119991, Russia

    A. A. Lazarev, A. G. Kvaratskheliya & E. R. Gafarov

Authors
  1. A. A. Lazarev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. G. Kvaratskheliya
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. R. Gafarov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © A.A. Lazarev, A.G. Kvaratskheliya, E.R. Gafarov, 2007, published in Doklady Akademii Nauk, 2007, Vol. 412, No. 6, pp. 739–742.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lazarev, A.A., Kvaratskheliya, A.G. & Gafarov, E.R. Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine. Dokl. Math. 75, 130–133 (2007). https://doi.org/10.1134/S106456240701036X

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S106456240701036X

Keywords

Search

Navigation