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.
2011
2011
The single machine scheduling problem is foundational to the study of production scheduling in general. This article describes… 
2010
2010
We propose a Dynamic Hybrid Scheduler (DHS) for Mobile Broadband Wireless Systems composed by two basic components, corresponding… 
2007
2007
In this study, we introduce an actual time-dependent learning effect into single-machine scheduling problems. The actual time… 
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
This chapter is concerned with single machine scheduling. As mentioned in the previous chapter, three performance criteria will… 
2003
2003
In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and nonreal-time packet-switched data… 
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… 
1981
1981
Some results of Sidney (Sidney, J. B. 1975. Decomposition algorithms for single machine sequencing with precedence relations and… 
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…