Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
- 162 Downloads
We consider the problem of maximizing total tardiness on a single machine, where the first job starts at time zero and idle times between the processing of jobs are not allowed. We present a modification of an exact pseudo-polynomial algorithm based on a graphical approach, which has a polynomial running time. This result settles the complexity status of the problem under consideration which was open.
KeywordsScheduling Single machine problems Maximization problems Total tardiness Polynomial algorithm
This work was partially supported by DAAD (Deutscher Akademischer Austausch- dienst): A/08/80442/Ref. 325. The authors are grateful to the referees for their constructive comments, which substantially improved the presentation of the results.
- Gafarov, E. R., Lazarev, A. A., & Werner, F. (2010b). A modification of dynamic programming algorithms to reduce the running time or/and complexity. Preprint 20/10, FMA, Otto-von-Guericke-Universität Magdeburg. Google Scholar
- Gafarov, E. R., Lazarev, A. A., & Werner, F. (2010c). Classical combinatorial and single machine scheduling problems with opposite optimality criteria. Preprint 11/10, FMA, Otto-von-Guericke-Universität Magdeburg. Google Scholar
- Lazarev, A. A., & Gafarov, E. R. (2006b). Scheduling theory. Total tardiness problem. Moscow: Computing Center of the Russian Academy of Sciences, 128 pp. (in Russian). Google Scholar