Abstract
A recent INFORMS Journal on Computing paper presents a fully polynomial time approximation scheme for minimizing the completion time variance with agreeable weights on a single machine. This paper presents a much faster scheme for this problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
