Login / Signup
The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times.
Radoslaw Rudek
Published in:
Appl. Math. Comput. (2013)
Keyphrases
</>
complexity analysis
flowshop
scheduling problem
processing times
flowshop scheduling problems
job processing times
theoretical analysis
single machine
np complete
lower bound
special case
first order logic
dynamic programming
np hard
sequence dependent setup times
job shop
computational complexity