Login / Signup
New approximate algorithms for the customer order scheduling problem with total completion time objective.
Jose M. Framiñan
Paz Perez-Gonzalez
Published in:
Comput. Oper. Res. (2017)
Keyphrases
</>
scheduling problem
significant improvement
data mining
data structure
computationally efficient
neural network
computational complexity
search space
computational cost
np hard
theoretical analysis
benchmark datasets
customer service