期刊名称：Visnyk NTUU KPI : Informatics, Operation and Computer Science
印刷版ISSN：0135-1729
出版年度：2012
期号：57
出版社：National Technical University of Ukraine
摘要：In this paper we consider one class of multistage network calendar scheduling problem. For arbitrarily given finite due dates (due dates for finished products’ release) it is necessary to obtain a feasible schedule with the latest startup time of the technological process. With the additional constraint on the structure of a feasible schedule the exact polynomial algorithm for solving the formulated problem was stated. The theoretical and practical grounding for expedience of the introduction of additional restrictions on the structure of the desirable schedule was presented.
