Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 papers from all fields of science
Search
Sign In
Create Free Account
Single-machine scheduling
Known as:
Earliest due date
, Edd
, Single machine scheduling
Single-machine scheduling or single-resource scheduling is the process of assigning a group of tasks to a single machine or resource. The tasks are…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Genetic algorithm
Simulated annealing
Tardiness (scheduling)
Broader (1)
Mathematical optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Single-machine scheduling with both deterioration and learning effects
Dar-Li Yang
,
W. Kuo
Annals of Operations Research
2009
Corpus ID: 3551621
This paper considers a single-machine scheduling problem with both deterioration and learning effects. The objectives are to…
Expand
2006
2006
Single Machine Scheduling Problems with Learning Effect
Zhao You-li
2006
Corpus ID: 124598363
This paper considers a single machine scheduling problem in which the job processing times will decrease as a result of learning…
Expand
2004
2004
Channel-quality dependent earliest deadline due fair scheduling schemes for wireless multimedia networks
Ahmed K. F. Khattab
,
K. Elsayed
International Conference on Modeling, Analysis…
2004
Corpus ID: 1944345
Providing delay guarantees to time-sensitive traffic in wireless multimedia networks is a challenging issue. This is due to the…
Expand
Highly Cited
2004
Highly Cited
2004
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
D. Shabtay
Computers & Operations Research
2004
Corpus ID: 9958095
Highly Cited
2004
Highly Cited
2004
Applying scheduling techniques to minimize the number of late jobs in workflow systems
Gregório Baggio
,
Jacques Wainer
,
C. Ellis
ACM Symposium on Applied Computing
2004
Corpus ID: 15336988
Ordering the cases in a workflow can result in significant decrease on the number of late jobs. But merging workflow and…
Expand
2004
2004
Maximization Problems in Single Machine Scheduling
M. Aloulou
,
M. Kovalyov
,
M. Portmann
Annals of Operations Research
2004
Corpus ID: 86771
Problems of scheduling n jobs on a single machine to maximize regular objective functions are studied. Precedence constraints may…
Expand
Highly Cited
2002
Highly Cited
2002
Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
Suk-Hun Yoon
,
J. A. Ventura
Computers & Operations Research
2002
Corpus ID: 7152508
1998
1998
Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
Sushil Verma
,
M. Dessouky
Mathematics of Operations Research
1998
Corpus ID: 16815854
The problem of determining a schedule of jobs with unit-time lengths on a single machine that minimizes the total weighted…
Expand
Highly Cited
1994
Highly Cited
1994
Scheduling Manufacturing Systems of Re-Entrant Lines
P. Kumar
1994
Corpus ID: 17570064
Re-entrant lines axe manufacturing systems where parts may return more than once to the same machine, for repeated stages of…
Expand
Highly Cited
1977
Highly Cited
1977
Analysis of the Earliest Due Date Scheduling Rule in Queueing Systems
Henry M. Goldberg
Mathematics of Operations Research
1977
Corpus ID: 39663485
We investigate a model for a general single server queueing system operating under the earliest due date scheduling rule, which…
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