标题：Investigation of properties and solution to the problem “Minimizing the total penalty for both advancing and delayed relatively legislative terms in carrying out of independent tasks with one device”
期刊名称：Visnyk NTUU KPI : Informatics, Operation and Computer Science
印刷版ISSN：0135-1729
出版年度：2008
卷号：48
出版社：National Technical University of Ukraine
摘要：One machine scheduling problem to minimize total earliness and tardiness (E/T) is considered. This problem is NP-hard, therefore local search approaches are very useful to find good schedules that are close to optimum. Some new properties of a problem are presented which allow us to construct an effective procedure of searching the solutions that are close to optimum. An example of the problem solution is shown.
