标题：A Branch and Bound Algorithm for Statistical Studies of a New PDC-Algorithm for Solving the Single Machine Total Tardiness Weighted Tardiness Problem
期刊名称：Visnyk NTUU KPI : Informatics, Operation and Computer Science
印刷版ISSN：0135-1729
出版年度：2012
期号：55
出版社：National Technical University of Ukraine
摘要：Provided here is a state-of-the-art survey of research results on minimizing total weighted tardiness of processing jobs on a single machine. We suggest an effective branch-and-bound algorithm for solving this problem and which is intended to be used in statistical studies of characteristics of new PDC-algorithm.
