@inproceedings{Awasthi:2013:CDP:2624948.2625026,
 author = {Awasthi, Abhishek and L\"{a}ssig, J\"{o}rg and Kramer, Oliver},
 title = {Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence},
 booktitle={Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2013 15th International Symposium on}, 
 series = {SYNASC '13},
 year = {2013},
 isbn = {978-1-4799-3036-4},
 pages = {258--264},
 numpages = {7},
 url = {http://dx.doi.org/10.1109/SYNASC.2013.41},
 doi = {10.1109/SYNASC.2013.41},
 acmid = {2625026},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA},
 keywords={computational complexity;processor scheduling;common due-date problem;exact polynomial algorithms;job scheduling;job sequence;parallel machine;run-time complexities;single and parallel machine;Benchmark testing;Complexity theory;Heuristic algorithms;Linear programming;Parallel machines;Polynomials},
 doi={10.1109/SYNASC.2013.41},
}