Brief Announcement: Scheduling Jobs for Minimum Span: Improved Bounds and Learning-Augmented Algorithms

被引：0

作者：

Liu, Mozhengfu ^{[1
]}

Tang, Xueyan ^{[2
]}

机构：

[1] Northwestern Univ, Evanston, IL 60201 USA

[2] Nanyang Technol Univ, Singapore, Singapore

来源：

PROCEEDINGS OF THE 36TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2024 | 2024年

关键词：

scheduling; span; competitive ratio; algorithms with predictions;

D O I：

10.1145/3626183.3660263

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study a flexible job scheduling problem. A set of jobs is released over time, each with a starting deadline and a processing length. The jobs are to be started by an online scheduler no later than their starting deadlines and will run nonpreemptively. The objective is to minimize the span - the time duration for which at least one job is running. We present a new lower bound of 4 on the competitiveness of any online algorithm. We also establish tight competitiveness bounds in the learning-augmented setting of the problem.

引用

页码：141 / 143

页数：3

共 43 条

[31] Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model
Pei, Guanhong
Vullikanti, Anil Kumar S.
DISTRIBUTED COMPUTING, DISC 2012, 2012, 7611 : 407 - +
[32] Improved approximation algorithms for minimum-space advertisement scheduling
Dean, BC
Goemans, MX
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2003, 2719 : 1138 - 1152
[33] Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines
Zhou, Hao
Zhou, Ping
Jiang, Yiwei
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2015, 32 (05)
[34] Brief Announcement: Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths
Cao, Nairen
Fineman, Jeremy T.
Russell, Katina
PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 511 - 513
[35] Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds
Augustine, John
Moses, William K., Jr.
Pandurangan, Gopal
PROCEEDINGS OF THE 2022 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2022, 2022, : 51 - 53
[36] MINIMUM NUMBER OF TARDY JOBS IN SINGLE-MACHINE SCHEDULING WITH RELEASE DATES - AN IMPROVED ALGORITHM
JOHN, TC
WU, YB
COMPUTERS & INDUSTRIAL ENGINEERING, 1987, 12 (03) : 223 - 230
[37] II-LA-KM: Improved Initialization of a Learning-Augmented Clustering Algorithm for Effective Rock Discontinuity Grouping
Xu, Yihang
Wu, Junxi
Zhao, Guoyan
Wang, Meng
Zhou, Xing
MATHEMATICS, 2024, 12 (20)
[38] 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
[39] Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
Wenjie Li
Jinjiang Yuan
Optimization Letters, 2014, 8 : 1691 - 1706
[40] Solution algorithms for the number of tardy jobs minimisation scheduling with a time-dependent learning effect
Wang, Zhenyou
Wei, Cai-Min
Sun, Linhui
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (11) : 3141 - 3148

← 1 2 3 4 5 →