Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence

Abhishek Awasthi, Jörg Lässig, Oliver Kramer. Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence. In 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013, Timisoara, Romania, September 23-26, 2013. pages 258-264, IEEE, 2013. [doi]

Abstract

Abstract is missing.