N. Bansal, H. Chan, R. Khandekar, K. Pruhs, C. Stein, B. Schieber
{"title":"Non-Preemptive Min-Sum Scheduling with Resource Augmentation","authors":"N. Bansal, H. Chan, R. Khandekar, K. Pruhs, C. Stein, B. Schieber","doi":"10.1109/FOCS.2007.46","DOIUrl":null,"url":null,"abstract":"We give the first O(l)-speed O(l) approximation polynomial-time algorithms for several nonpreemptive min-sum scheduling problems where jobs arrive over time and must be processed on one machine. More precisely, we give the first O(l)-speed O(l)-approximations for the non-preemptive scheduling problems; l|r<sub>j</sub>| Sigmaw<sub>j</sub>F<sub>j</sub> (weighted flow time), l |r<sub>j</sub>| SigmaT<sub>j</sub> (total tardiness), the broadcast version of 1 |r<sub>j</sub>| Sigmaw<sub>j</sub>F<sub>j</sub> , an O(I)-speed, 1-approximation for l |r<sub>j</sub>| Sigma U macr<sub>j</sub> (throughput maximization), and an O(l)-machine, O(l)-speed O(1)-approximation for l |r<sub>j</sub>| Sigmaw<sub>j</sub>T<sub>j</sub> (weighted tardiness). Our main contribution is an integer programming formulation whose relaxation is sufficiently close to the integer optimum, and which can be transformed to a schedule on a faster machine.","PeriodicalId":197431,"journal":{"name":"48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2007-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FOCS.2007.46","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32
Abstract
We give the first O(l)-speed O(l) approximation polynomial-time algorithms for several nonpreemptive min-sum scheduling problems where jobs arrive over time and must be processed on one machine. More precisely, we give the first O(l)-speed O(l)-approximations for the non-preemptive scheduling problems; l|rj| SigmawjFj (weighted flow time), l |rj| SigmaTj (total tardiness), the broadcast version of 1 |rj| SigmawjFj , an O(I)-speed, 1-approximation for l |rj| Sigma U macrj (throughput maximization), and an O(l)-machine, O(l)-speed O(1)-approximation for l |rj| SigmawjTj (weighted tardiness). Our main contribution is an integer programming formulation whose relaxation is sufficiently close to the integer optimum, and which can be transformed to a schedule on a faster machine.