Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,409,075 papers from all fields of science
Search
Sign In
Create Free Account
Scheduling (computing)
Known as:
Task scheduler
, Non-deterministic Scheduling
, Deterministic Scheduling
Expand
In computing, scheduling is the method by which work specified by some means is assigned to resources that complete the work. The work may be virtual…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
"Classic" Mac OS
Background Intelligent Transfer Service
Blocking (computing)
Client–server model
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Multi period disassembly-to-order of end of life product based on scheduling to maximize the profit in reverse logistic operation
T. Sathish
,
J. Jayaprakash
,
P. V. Senthil
,
R. Saravanan
2017
Corpus ID: 55751871
In recent era, the creation of electronic contraptions is expanding step by step, which leads to tremendous electronic waste…
Expand
Highly Cited
2012
Highly Cited
2012
Wireless information transfer with opportunistic energy harvesting
Liang Liu
,
Rui Zhang
,
K. Chua
IEEE International Symposium on Information…
2012
Corpus ID: 43885603
Energy harvesting is a promising solution to prolong the operation of energy-constrained wireless networks. In particular…
Expand
Highly Cited
2010
Highly Cited
2010
Jena Research Papers in Business and Economics Optimally Routing and Scheduling Tow Trains for JIT-Supply of Mixed-Model Assembly Lines
N. Boysen
2010
Corpus ID: 14264961
In recent years, more and more automobile producers adopted the supermarketconcept to enable a exible and reliable Just-in-Time…
Expand
Review
2008
Review
2008
IEEE Communications Surveys & Tutorials - second quarter 2008
Nelson Da Fonseca
IEEE Communications Surveys and Tutorials
2008
Corpus ID: 17315935
2 Welcome to the second IEEE Communications Surveys and Tutorials issue of 2008. The articles in this issue, which we now briefly…
Expand
Highly Cited
2005
Highly Cited
2005
Throughput Optimal Control of Cooperative Relay Networks
E. Yeh
,
R. Berry
IEEE Transactions on Information Theory
2005
Corpus ID: 15678661
In cooperative relaying, multiple nodes cooperate to forward a packet within a network. To date, such schemes have been primarily…
Expand
Highly Cited
2004
Highly Cited
2004
A novel decentralized ethernet-based PON access architecture for provisioning differentiated QoS
S. Sherif
,
A. Hadjiantonis
,
G. Ellinas
,
C. Assi
,
Mohamed A. Ali
Journal of Lightwave Technology
2004
Corpus ID: 24136248
To date, the mainstream ethernet passive optical network (EPON) bandwidth allocation schemes as well as the new IEEE 802.3ah…
Expand
Highly Cited
2003
Highly Cited
2003
On the performance of graph-based scheduling algorithms for packet radio networks
A. Behzad
,
I. Rubin
GLOBECOM '03. IEEE Global Telecommunications…
2003
Corpus ID: 28126241
Many published algorithms used for scheduling transmissions in packet radio networks are based on finding maximal independent…
Expand
Highly Cited
1997
Highly Cited
1997
Quality-of-service-oriented medium access control for wireless ATM networks
N. Passas
,
S. Paskalis
,
D. Vali
,
L. Merakos
IEEE Communications Magazine
1997
Corpus ID: 2200121
The medium access control (MAC) protocol and the underlying traffic scheduling algorithm developed within project Magic WAND…
Expand
Highly Cited
1993
Highly Cited
1993
PERTS: A prototyping environment for real-time systems
Proceedings Real-Time Systems Symposium
1993
Corpus ID: 17834256
PERTS is a prototyping environment for real-time systems. It contains schedulers and resource access protocols for time-critical…
Expand
Highly Cited
1964
Highly Cited
1964
On Scheduling Problems with Deferral Costs
E. Lawler
1964
Corpus ID: 62716184
A class of scheduling problems involving deferral costs has been formulated by McNaughton, who has described a simple method of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE