Abstract
We derive a 3 2 -approximation algorithm for the NP-hard parallel machine total weighted completion time problem with controllable processing times by the technique of convex quadratic programming relaxation.
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
