Login / Signup
On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems.
Martin Charles Golumbic
Haim Kaplan
Elad Verbin
Published in:
Discret. Math. (2005)
Keyphrases
</>
scheduling problem
worst case
computational complexity
decision problems
single machine
data sets
response time
processing times
precedence constraints
sequencing problems
computational cost
space complexity
job shop scheduling problem
setup times
uml class diagrams