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

Abhishek Awasthi Jörg Lässig Oliver Kramer

Published in: CoRR (2013)

Keyphrases

computational cost
brute force
significant improvement
theoretical analysis
benchmark datasets
recently developed
neural network
computational complexity
data sets
feature selection
image processing
special case
orders of magnitude