期刊名称：Visnyk NTUU KPI : Informatics, Operation and Computer Science
印刷版ISSN：0135-1729
出版年度：2014
期号：61
语种：English
出版社：National Technical University of Ukraine
摘要：We consider a scheduling problem of independent tasks execution with arbitrary durations and various due dates on a single machine by minimizing the total earliness and finding the maximum startup time of the tasks in a feasible schedule. The exact polynomial algorithms are proposed.
