Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
This paper considers a single-machine scheduling problem with both deterioration and learning effects. The objectives are to… 
2006
2006
This paper considers a single machine scheduling problem in which the job processing times will decrease as a result of learning… 
2004
2004
Providing delay guarantees to time-sensitive traffic in wireless multimedia networks is a challenging issue. This is due to the… 
Highly Cited
2004
Highly Cited
2004
Ordering the cases in a workflow can result in significant decrease on the number of late jobs. But merging workflow and… 
2004
2004
Problems of scheduling n jobs on a single machine to maximize regular objective functions are studied. Precedence constraints may… 
1998
1998
The problem of determining a schedule of jobs with unit-time lengths on a single machine that minimizes the total weighted… 
Highly Cited
1994
Highly Cited
1994
Re-entrant lines axe manufacturing systems where parts may return more than once to the same machine, for repeated stages of… 
Highly Cited
1977
Highly Cited
1977
We investigate a model for a general single server queueing system operating under the earliest due date scheduling rule, which…