Skip to main content
SpringerLink
Log in

Decomposition algorithm to minimize total tardiness

  • Published:
Journal of Mathematical Sciences 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. V. S. Tanaev, V. S. Gordon, and Ya. M. Shafranskii, Scheduling Theory. Single-Stage Systems [in Russian], Moscow (1984).

  2. E. L. Lawler, “A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness,” Ann. Discr. Math.,1, 331–342 (1977).

    Google Scholar 

Download references

Authors
  1. A. A. Lazarev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, No. 17, pp. 71–78, 1990.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lazarev, A.A. Decomposition algorithm to minimize total tardiness. J Math Sci 71, 2772–2774 (1994). https://doi.org/10.1007/BF02110584

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02110584

Keywords

Search

Navigation