یک زمان چندجملهای الگوریتم تکرار را برای مسأله مسائل مربوط به هزینه زمان تکرار می کند: مساله مهلت خطای سقوط خطی و محدب

We present here previously unknown properties of the PD-algorithm, and a new concept of cut-decomposition. These properties are used in devising the repeated cuts algorithm based on scaling. The repeated cuts algorithm solves in polynomial time, the linear as well as the convex TCTP. The algorithm solves the TCTP problem in polynomial time even when the durations and/or the target deadline are not necessarily integers.