{"title":"Approximation Algorithms for Scheduling Problems","authors":"J. König, R. Giroudeau","doi":"10.1201/9781420072747-c2","DOIUrl":"https://doi.org/10.1201/9781420072747-c2","url":null,"abstract":"Bidding to the top : VCG and equilibria of position-based auctions p. 15 Coping with interference : from maximum coverage to planning cellular networks p. 29 Online dynamic programming speedups p. 43 Covering many or few points with unit disks p. 55 On the minimum corridor connection problem and other generalized geometric problems p. 69 Online k-server routing problems p. 83 Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem p. 95 Improved approximation bounds for edge dominating set in dense graphs p. 108 A randomized algorithm for online unit clustering p. 121 On hierarchical diameter-clustering, and the supplier problem p. 132 Bin packing with rejection revisited p. 146 On bin packing with conflicts p. 160 Approximate distance queries in disk graphs p. 174 Network design with edge-connectivity and degree constraints p. 188 Approximating maximum cut with limited unbalance p. 202 Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems p. 214 Improved online hypercube packing p. 226 Competitive online multicommodity routing p. 240 The k-allocation problem and its variants p. 253 An experimental study of the misdirection algorithm for combinatorial auctions p. 265 Reversal distance for strings with duplicates : linear time approximation using hitting set p. 279 Approximating the unweighted k-set cover problem : greedy meets local search p. 290 Approximation algorithms for multi-criteria traveling salesman problems p. 302 The survival of the weakest in networks p. 316 Online distributed object migration p. 330","PeriodicalId":243133,"journal":{"name":"Introduction to Scheduling","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129862704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Steady-State Scheduling","authors":"Olivier Beaumont, L. Marchal","doi":"10.1201/9781420072747-13","DOIUrl":"https://doi.org/10.1201/9781420072747-13","url":null,"abstract":"In this chapter, we propose a general framework for deriving efficient (polynomial-time) algorithms for steady-state scheduling. In the context of large scale platforms (grids or volunteer computing platforms), we show that the characteristics of the resources (volatility, heterogeneity) limit their use to large regular applications. Therefore, steady-state scheduling, that consists in optimizing the number of tasks that can be processed per time unit when the number of tasks becomes arbitrarily large, is a reasonable setting. In this chapter, we concentrate on bag-of-tasks and collective communications (broadcast and multicast) applications and we prove that efficient schedules can be derived in the context of steady-state scheduling, under realistic communication models that take into account both the heterogeneity of the resources and the contentions in the communication network. 8.","PeriodicalId":243133,"journal":{"name":"Introduction to Scheduling","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133609643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the Complexity of Scheduling","authors":"P. Brucker, S. Knust","doi":"10.1201/9781420072747-c1","DOIUrl":"https://doi.org/10.1201/9781420072747-c1","url":null,"abstract":"","PeriodicalId":243133,"journal":{"name":"Introduction to Scheduling","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115340023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cyclic Scheduling for the Synthesis of Embedded Systems","authors":"Olivier Marchetti, Alix Munier Kordon","doi":"10.1201/9781420072747-C6","DOIUrl":"https://doi.org/10.1201/9781420072747-C6","url":null,"abstract":"This chapter is devoted to the study of timed weighted event graphs, which constitute a subclass of Petri nets often considered for modeling embedded applications such as video encoders. Some basic recent mathemat- ical properties are presented, leading to algorithms checking the liveness and computing the optimum throughput of these systems.","PeriodicalId":243133,"journal":{"name":"Introduction to Scheduling","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126029816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-Objective Scheduling","authors":"P. Dutot, K. Rządca, Erik Saule, D. Trystram","doi":"10.1201/9781420072747-c9","DOIUrl":"https://doi.org/10.1201/9781420072747-c9","url":null,"abstract":"This chapter considers multi-objective scheduling, i.e., schedul- ing with simultaneous optimization of several objectives. The main motivation to optimize more than one objective is the growing complexity of modern sys- tems. Characterizing by one variable only the performance of a heterogeneous system with many users shows a narrow view of the system. In multi-objective scheduling, one can explicitly model, optimize, and find trade-offs between various performance measures. We introduce multi-objective scheduling on three motivating problems to illustrate different approaches. In MaxAndSum, a scheduler optimizes both the makespan and the sum of completion times. In EfficientReliable, the goal is to find the trade-off between the makespan and the reliability of schedule on failing processors. Finally, in TwoAgentMinSum, a processor must be shared fairly between jobs produced by two independent users. We study the complexity of these three problems and propose different approaches to obtain an acceptable solution. In MaxAndSum, an algorithm","PeriodicalId":243133,"journal":{"name":"Introduction to Scheduling","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134212890","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Divisible Load Scheduling","authors":"M. Gallet, Y. Robert, F. Vivien","doi":"10.1201/9781420072747-c8","DOIUrl":"https://doi.org/10.1201/9781420072747-c8","url":null,"abstract":"","PeriodicalId":243133,"journal":{"name":"Introduction to Scheduling","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128916771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comparisons of Stochastic Task-Resource Systems","authors":"B. Gaujal, J. Vincent","doi":"10.1201/9781420072747-c10","DOIUrl":"https://doi.org/10.1201/9781420072747-c10","url":null,"abstract":"","PeriodicalId":243133,"journal":{"name":"Introduction to Scheduling","volume":"42 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131727707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Influence of Platform Models on Scheduling Techniques","authors":"Lionel Eyraud-Dubois, Arnaud Legrand","doi":"10.1201/9781420072747-c11","DOIUrl":"https://doi.org/10.1201/9781420072747-c11","url":null,"abstract":"","PeriodicalId":243133,"journal":{"name":"Introduction to Scheduling","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127953616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：