Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou
{"title":"在相同机器上实现吞吐量最大化的竞争性算法","authors":"Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou","doi":"10.1007/s10107-023-02045-0","DOIUrl":null,"url":null,"abstract":"<p>This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on <i>m</i> identical machines. The main result is an <i>O</i>(1) competitive deterministic algorithm for any number of machines <span>\\(m >1\\)</span>.\n</p>","PeriodicalId":18297,"journal":{"name":"Mathematical Programming","volume":"44 1","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A competitive algorithm for throughput maximization on identical machines\",\"authors\":\"Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou\",\"doi\":\"10.1007/s10107-023-02045-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on <i>m</i> identical machines. The main result is an <i>O</i>(1) competitive deterministic algorithm for any number of machines <span>\\\\(m >1\\\\)</span>.\\n</p>\",\"PeriodicalId\":18297,\"journal\":{\"name\":\"Mathematical Programming\",\"volume\":\"44 1\",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-01-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Programming\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10107-023-02045-0\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Programming","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10107-023-02045-0","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
摘要
本文研究了一个基本问题，即通过抢占式在线作业调度，在 m 台相同机器上最大限度地提高在截止日期前完成作业的数量。主要结果是针对任意机器数量（m >1\）的 O（1）竞争确定性算法。
A competitive algorithm for throughput maximization on identical machines
This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on m identical machines. The main result is an O(1) competitive deterministic algorithm for any number of machines \(m >1\).
期刊介绍：
Mathematical Programming publishes original articles dealing with every aspect of mathematical optimization; that is, everything of direct or indirect use concerning the problem of optimizing a function of many variables, often subject to a set of constraints. This involves theoretical and computational issues as well as application studies. Included, along with the standard topics of linear, nonlinear, integer, conic, stochastic and combinatorial optimization, are techniques for formulating and applying mathematical programming models, convex, nonsmooth and variational analysis, the theory of polyhedra, variational inequalities, and control and game theory viewed from the perspective of mathematical programming.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
