Skip to main content
SpringerLink
Log in

Minimization of the maximal lateness for a single machine

  • Intellectual Control Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Consideration was given to the classical NP-hard problem 1|r j |L max of the scheduling theory. An algorithm to determine the optimal schedule of processing n jobs where the job parameters satisfy a system of linear constraints was presented. The polynomially solvable area of the problem 1|r j |L max was expanded. An algorithm was described to construct a Pareto-optimal set of schedules by the criteria L max and C max for complexity of O(n 3logn) operations.

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

Similar content being viewed by others

References

  1. Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G., Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey, Ann. Discret. Math., 1979, vol. 5, pp. 287–326.

    Article  MathSciNet  MATH  Google Scholar 

  2. Lenstra, J.K., Rinnooy Kan, A.H.G., and Brucker, P., Complexity of Machine Scheduling Problems, Ann. Discret. Math., 1977, vol. 1, pp. 343–362.

    Article  MathSciNet  MATH  Google Scholar 

  3. Jackson, J.R., Scheduling a Production Line to Minimize Maximum Tardiness, Manag. Sci. Res. Project. Res. Report no. 43, Los Angeles: Univ. of California, 1955.

    Google Scholar 

  4. Simons, B.B., A Fast Algorithm for Single Processor Scheduling, in 19 Ann. Sympos. Found. Comp. Sci., Ann Arbor, 1978, pp. 246–252.

    Google Scholar 

  5. Hoogeven, J.A., Minimizing Maximum Promptness and Maximum Lateness on a Single Machine, Math. Oper. Res., 1996, vol. 21, pp. 100–114.

    Article  MathSciNet  MATH  Google Scholar 

  6. Lazarev, A.A., Teoriya raspisanii. Otsenka absolyutnoi pogreshnosti i skhema priblizhennogo resheniya zadach teorii raspisanii (Scheduling Theory. Estimation of the Absolute Error and a Scheme of Approximate Solution of the Problems of Scheduling Theory), Moscow: MFTI, 2008.

    Google Scholar 

  7. Lazarev, A.A., Arkhipov, D.I., and Karpov, I.V., Polynomially Solvable Case of the NP-hard Problem 1|r j|L max, in Int. Conf. Project Management Sched., Tours, 2010, pp. 289–293.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

    A. A. Lazarev & D. I. Arkhipov

  2. National Research University Higher School of Economics, Moscow, Russia

    A. A. Lazarev

  3. Lomonosov State University, Moscow, Russia

    A. A. Lazarev

  4. Moscow Physical and Technical Institute, Dolgoprudnyi, Russia

    A. A. Lazarev

Authors
  1. A. A. Lazarev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. I. Arkhipov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. A. Lazarev.

Additional information

Original Russian Text © A.A. Lazarev, D.I. Arkhipov, 2016, published in Avtomatika i Telemekhanika, 2016, No. 4, pp. 134–152.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lazarev, A.A., Arkhipov, D.I. Minimization of the maximal lateness for a single machine. Autom Remote Control 77, 656–671 (2016). https://doi.org/10.1134/S000511791604010X

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation