Automation and Remote Control

, Volume 77, Issue 4, pp 656–671 | Cite as

Minimization of the maximal lateness for a single machine

  • A. A. LazarevEmail author
  • D. I. Arkhipov
Intellectual Control Systems


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.


Remote Control Optimal Schedule Single Machine Partial Schedule Schedule Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 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.MathSciNetCrossRefzbMATHGoogle Scholar
  3. 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. 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. 5.
    Hoogeven, J.A., Minimizing Maximum Promptness and Maximum Lateness on a Single Machine, Math. Oper. Res., 1996, vol. 21, pp. 100–114.MathSciNetCrossRefzbMATHGoogle Scholar
  6. 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. 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

Copyright information

© Pleiades Publishing, Ltd. 2016

Authors and Affiliations

  1. 1.Trapeznikov Institute of Control SciencesRussian Academy of SciencesMoscowRussia
  2. 2.National Research University Higher School of EconomicsMoscowRussia
  3. 3.Lomonosov State UniversityMoscowRussia
  4. 4.Moscow Physical and Technical InstituteDolgoprudnyiRussia

Personalised recommendations