On-line scheduling with hard deadlines - (Extended abstract)

被引：0

作者：

Goldman, SA ^{[1
]}

Parwatikar, J ^{[1
]}

Suri, S ^{[1
]}

机构：

[1] Washington Univ, Dept Comp Sci, St Louis, MO 63130 USA

来源：

ALGORITHMS AND DATA STRUCTURES | 1997年 / 1272卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study non-preemptive, online admission control in the deadline model: each job must be either serviced prior to its deadline, or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be started. The goal is to maximize total resource utilization. We obtain a series of results, under varying assumptions of job lengths and delays.

引用

页码：258 / 271

页数：14

共 50 条

[41] Calendar/abstract deadlines
Optics and Photonics News, 1999, 10 (02):
[42] Calendar/abstract deadlines
Optics and Photonics News, 1998, 9 (08):
[43] Extended dispatching rule approach in an on-line scheduling framework for batch process management
Int J Prod Res, 2 (329):
[44] Calendar/abstract deadlines
1600, Optical Soc of America, Washington, DC, USA (11):
[45] Calendar/abstract deadlines
Optics and Photonics News, 1994, 5 (05):
[46] An extended dispatching rule approach in an on-line scheduling framework for batch process management
Ishii, N
Muraki, M
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (02) : 329 - 348
[47] Optimal Distributed Scheduling of Real-Time Traffic with Hard Deadlines
Lu, Ning
Li, Bin
Srikant, R.
Ying, Lei
2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 4408 - 4413
[48] Optimal Online Scheduling With Arbitrary Hard Deadlines in Multihop Communication Networks
Mao, Zhoujia
Koksal, Can Emre
Shroff, Ness B.
IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (01) : 177 - 189
[49] Batch scheduling with deadlines on parallel machines: An NP-hard case
Kovalyov, MY
Shafransky, YM
INFORMATION PROCESSING LETTERS, 1997, 64 (02) : 69 - 74
[50] Batch scheduling with deadlines on parallel machines: An NP-hard case
Institute of Engineering Cybernetics, Natl. Academy of Sciences of Belarus, Surganova 6, 220012 Minsk, Belarus
Inf. Process. Lett., 2 (69-74):

← 1 2 3 4 5 →