Login / Signup
N-extendible Posets, and How to Minimize Total Weighted Completion Time.
Markus Peter
Georg Wambach
Published in:
Discret. Appl. Math. (2000)
Keyphrases
</>
minimize total
single machine
total cost
parallel machines
release dates
scheduling problem
processing times
dynamic programming
decision trees
single machine scheduling problem