Minimum Makespan Scheduling with Low Rank Processing Times.

Aditya Bhaskara Ravishankar Krishnaswamy Kunal Talwar Udi Wieder

Published in: SODA (2013)

Keyphrases

processing times
low rank
scheduling problem
scheduling jobs
release dates
identical machines
single machine
identical parallel machines
precedence relations
convex optimization
setup times

missing data
linear combination
matrix factorization
flowshop
release times
matrix completion
low rank matrix
singular value decomposition
single machine scheduling problem
job processing times
semi supervised

rank minimization
high order
sequence dependent setup times
high dimensional data
resource consumption
makespan minimization
parallel machines
completion times
precedence constraints
trace norm

scheduling decisions
job shop
minimum cost
tabu search
np hard
special case
machine learning
collaborative filtering
small number
pairwise