Login / Signup
On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions.
Mabel C. Chou
Hui Liu
Maurice Queyranne
David Simchi-Levi
Published in:
Oper. Res. (2006)
Keyphrases
</>
single machine
total weighted tardiness
competitive ratio
dynamic programming
processing times
earliness tardiness
learning algorithm
minimize total
objective function
np hard
single machine scheduling problem
maximum lateness
worst case
release dates
search space
search algorithm
optimal solution