Login / Signup
A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective.
Maurice Queyranne
Maxim Sviridenko
Published in:
J. Algorithms (2002)
Keyphrases
</>
optimal solution
np hard
dynamic programming
objective function
search space
scheduling problem
simulated annealing
particle swarm optimization
min sum
computational complexity