期刊名称：Visnyk NTUU KPI : Informatics, Operation and Computer Science
印刷版ISSN：0135-1729
出版年度：2014
期号：61
语种：English
出版社：National Technical University of Ukraine
摘要：The article describes the properties research of the problem of creating a feasible schedule of jobs with the common due date on identical parallel machines with a maximum late start. Applying the methodology of PDC-algorithms the signs of optimal schedules are developed, which are defined on the basis of the permutations set that allow to consistently improve the value of the criterion. The polynomial component of the PDC-algorithm for the problem solution is developed. A practical application of the developed algorithm is considered. The experimental studies of the algorithm is given.
