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.
2008
2008
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of… 
2006
2006
This paper considers a single machine scheduling problem in which the job processing times will decrease as a result of learning… 
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… 
2001
2001
  • M. Bramson
  • 2001
  • Corpus ID: 22047288
We study multiclass queueing networks with the earliest-due-date, first-served (EDDFS) discipline. For these networks, the… 
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… 
1982
1982
Jeyaveerasingam George Shanthikumar The idea of decomposing a problem to simplify its solution is not new. However in recent… 
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…