期刊名称：Visnyk NTUU KPI : Informatics, Operation and Computer Science
印刷版ISSN：0135-1729
出版年度：2011
卷号：53
出版社：National Technical University of Ukraine
摘要：We consider the one machine scheduling problem of minimizing the total earliness and tardiness of independent tasks against due dates (ET) with setups. We propose a heuristic algorithm to search a local optimal solution of the problem. Experimental studies have shown the effectiveness of the algorithm, which allows to solve large dimensional problems for a short time.
