Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time.

J. A. Hoogeveen Steef L. van de Velde

Published in: Oper. Res. Lett. (1995)

Keyphrases

special case
np complete
high cost
neural network
cost reduction
processing times
multi agent
artificial intelligence
multi objective
np hard
information systems
total cost
maximum number
learning algorithm
minimal cost
lower cost
databases