The Total Tardiness of Tasks Minimization on Identical Parallel Machines with Arbitrary Fixed Times of Their Start and a Common Due Date

  • Michael Z. ZgurovskyEmail author
  • Alexander A. Pavlov
Part of the Studies in Systems, Decision and Control book series (SSDC, volume 173)


We solve a NP-hard problem of constructing a schedule for identical parallel machines that minimizes the total tardiness of tasks in relation to a common due date in case when the start times of machines are fixed at arbitrary time points less than the due date. We present an efficient PSC-algorithm of its solving which is a generalization of our previously developed results: for the problem with equal start times of machines we have derived two sufficient signs of optimality of a feasible solution and constructed two PSC-algorithms. Each of the algorithms checks one of these signs. In this chapter we propose a generalized PSC-algorithm for equal start times of machines that combines the best properties of both PSC-algorithms. We have obtained a modification of the generalized PSC-algorithm for the case of arbitrary start times of machines, its complexity is determined by O(n2m) function. The first polynomial component of the PSC-algorithm coincides with its second polynomial component. We obtain an efficient estimate of the deviation from an optimal solution for an approximation algorithm of the problem solving. We also present the statistical studies of the PSC-algorithm that showed its high efficiency (efficient exact solutions have been obtained for problems with tens of thousands of variables which is unique for NP-hard combinatorial optimization problems).


  1. 1.
    Zgurovsky, M.Z., Pavlov, A.A.: Prinyatie Resheniy v Setevyh Sistemah s Ogranichennymi Resursami (Принятие решений в сетевых системах с ограниченными ресурсами; Decision Making in Network Systems with Limited Resources). Naukova dumka, Kyiv (2010) (in Russian)Google Scholar
  2. 2.
    Pavlov, A.A., Misura, E.B.: Minimizaciya summarnogo zapazdyvaniya pri vypolnenii nezavisimyh zadanii s obschim direktivnym srokom identichnymi parallelnymi priborami, momenty zapuska kotoryh proizvolny (Минимизация суммарного запаздывания при выполнении независимых заданий с общим директивным сроком идентичными параллельными приборами, моменты запуска которых произвольны; The total tardiness minimization when processing independent tasks with a common due date on the identical parallel machines with an arbitrary starting times) // Visnyk NTUU KPI Inform. Oper. Comput. Sci. 59, 28–34 (2013) (in Russian)Google Scholar
  3. 3.
    Pavlov, A.A., Misura, E.B., Lisetsky T.N.: Sostavlenie raspisaniya vypolneniya nezavisimyh zadanii identichnymi parallelnymi priborami, momenty zapuska kotoryh menshe obschego direktivnogo sroka (Составление расписания выполнения независимых заданий идентичными параллельными приборами, моменты запуска которых меньше общего директивного срока; Scheduling independent tasks on the identical parallel machines which starting times are smaller than a common due date). Visnyk NTUU KPI Inform. Oper. Comput. Sci. 58, 24–28 (2013) (in Russian)Google Scholar
  4. 4.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co, San Francisco (1979) Scholar
  5. 5.
    Tanaev, V.S., Shkurba, V.V.: Vvedenie v Teoriju Raspisaniy (Введение в теорию расписаний; Introduction to Scheduling Theory). Nauka, Moscow (1975) (in Russian)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Kyiv Polytechnic InstituteNational Technical University of UkraineKyivUkraine
  2. 2.Faculty of Informatics and Computer ScienceNational Technical University of UkraineKyivUkraine

Personalised recommendations