Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
An efficient polynomial time algorithm for the problem of scheduling n unit length jobs with rational release times and deadlines on m identical parallel machines is presented. By using preprocessing, a running time of O(mn2) is obtained that is an improvement over the previous best running time of O(n3 log log n). The authors also present new NP completeness results for two closely related problems.
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Oliver Bodemer
IBM J. Res. Dev
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975