Login / Signup
A historical note on the complexity of scheduling problems.
Jan Karel Lenstra
Vitaly A. Strusevich
Milan Vlach
Published in:
Oper. Res. Lett. (2023)
Keyphrases
</>
scheduling problem
flowshop
processing times
space complexity
multiscale
evolutionary algorithm
single machine
limited capacity
real time
np hard
worst case