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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Abhishek Awasthi' in GoogleThis author has not been identified. Look up 'Jörg Lässig' in GoogleThis author has not been identified. Look up 'Oliver Kramer' in Google

runs on WebDSL