Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations

Article Details
Title:	Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations
Article URLs:	https://doi.org/10.1109/FOCS.2017.34 http://doi.ieeecomputersociety.org/10.1109/FOCS.2017.34
Alternative Article URLs:
Authors:	Shi Li	University at Buffalo, Department of Computer Science and Engineering
Sharing:	Unknown
Verification:	Author has not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/focs/Li17
Author Comments:

IEEE Foundations of Computer Science, FOCS 2017