Sign in
On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty.
Yakov M. Shafransky
Viktor Shinkarevich
Published in:
J. Sched. (2020)
Keyphrases
</>
interval data
minmax regret
scheduling problem
optimal solution
computational complexity
special case
data clustering
lower and upper bounds
resource allocation problems