期刊名称：Visnyk NTUU KPI : Informatics, Operation and Computer Science
印刷版ISSN：0135-1729
出版年度：2012
期号：56
出版社：National Technical University of Ukraine
摘要：Based on previous studies concerning properties of a problem to minimize total weighted tardiness of processing jobs on a single machine, constructed here is a PDC-algorithm that solves it. We single out polynomial and decompositional components of a proposed algorithm and formulate conditions under which those components are executed for a separate problem instance. Given algorithm allows for obtaining exact solutions for a wide range of large capacity instances within a reasonable time, as well as for finding close to optimal solutions when calculations are interrupted untimely. Algorithm conforms to parallel computing.
