A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines.

Ondrej Cepek Shao Chin Sung

Published in: Comput. Oper. Res. (2005)

Keyphrases

computational complexity
objective function
dynamic programming
optimal solution
learning algorithm
strongly np hard
identical parallel machines
np hard
fixed number
competitive ratio
search space
scheduling problem
worst case
monte carlo
combinatorial optimization
processing times