A note on scheduling equal-length jobs to maximize throughput

被引：31
|
作者：
Chrobak, M [1 ]
Dürr, C
Jawor, W
Kowalik, L
Kurowski, M
机构：
[1] Univ Calif Riverside, Dept Comp Sci, Riverside, CA 92521 USA
[2] Univ Paris 11, Rech Informat Lab, F-91405 Orsay, France
[3] Uniwersytet Warszawski, Inst Informat, PL-02097 Warsaw, Poland
来源：
JOURNAL OF SCHEDULING | 2006年 / 9卷 / 01期
基金：
美国国家科学基金会;
关键词：
Artificial Intelligence;
D O I：
10.1007/s10951-006-5595-4
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
An approach for scheduling of a problem using a polynomial-time algorithm technique, was described. The elegant feasibility algorithm of Carlier is based on dynamic programming and it processes jobs from left to right on the time-axis. The objective of the algorithm is to find a non-preemptive schedule that maximizes the number of jobs completed by their deadlines. Computing the minimum time to complete k jobs reduces the running time, as the size of the dynamic programming table and the time needed to compute a single entry are both reduced.
引用
收藏
页码：71 / 73
页数：3
相关论文
共 50 条
  • [1] A Note on Scheduling Equal-Length Jobs to Maximize Throughput
    Marek Chrobak
    Christoph Dürr
    Wojciech Jawor
    Łukasz Kowalik
    Maciej Kurowski
    Journal of Scheduling, 2006, 9 : 71 - 73
  • [2] Preemptive scheduling of equal-length jobs to maximize weighted throughput
    Baptiste, P
    Chrobak, M
    Dürr, C
    Jawor, W
    Vakhania, N
    OPERATIONS RESEARCH LETTERS, 2004, 32 (03) : 258 - 264
  • [3] Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput
    Bunde, David P.
    Goldwasser, Michael H.
    ALGORITHM THEORY - SWAT 2010, PROCEEDINGS, 2010, 6139 : 346 - +
  • [4] Scheduling Mutual Exclusion Accesses in Equal-Length Jobs
    Kagaris, Dimitri
    Dutta, Sourav
    ACM TRANSACTIONS ON PARALLEL COMPUTING, 2019, 6 (02)
  • [5] Online scheduling of equal-length jobs on parallel machines
    Ding, Jihuan
    Ebenlendr, Tomas
    Sgall, Jiri
    Zhang, Guochuan
    ALGORITHMS - ESA 2007, PROCEEDINGS, 2007, 4698 : 427 - +
  • [6] Scheduling equal-length jobs on identical parallel machines
    Baptiste, P
    DISCRETE APPLIED MATHEMATICS, 2000, 103 (1-3) : 21 - 32
  • [7] Preemptive scheduling of equal-length jobs in polynomial time
    Mertzios G.B.
    Unger W.
    Mathematics in Computer Science, 2010, 3 (1) : 73 - 84
  • [8] Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
    Li, Wenjie
    Zhang, Zhenkun
    Liu, Hailing
    Yuan, Jinjiang
    INFORMATION PROCESSING LETTERS, 2012, 112 (12) : 503 - 508
  • [9] Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
    Li, Wenjie
    Yuan, Jinjiang
    OPTIMIZATION LETTERS, 2014, 8 (05) : 1691 - 1706
  • [10] Online scheduling of equal-length jobs: Randomization and restarts help
    Chrobak, Marek
    Jawor, Wojciech
    Sgall, Jiri
    Tichy, Tomas
    SIAM JOURNAL ON COMPUTING, 2007, 36 (06) : 1709 - 1728
12345