Single-machine scheduling

Known as: Earliest due date, 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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2018
05019772018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper, single machine scheduling problems with sequence dependent setup times are considered. The objective is to… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2013
2013
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This paper studies the single-machine scheduling problem with deteriorating jobs and learning considerations. The objective is to… (More)
Is this relevant?
2009
2009
Abstract We consider the single machine scheduling problem with resource dependent release times and processing times, in which… (More)
Is this relevant?
2007
2007
We consider the scheduling problems arising when several agents, each owning a set of nonpreemptive jobs, compete to perform… (More)
  • table 1
Is this relevant?
2005
2005
We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper we study a single machine scheduling problem in which the job processing times will decrease as a result of… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We consider single-machine on-line scheduling problems where jobs arrive over time. A set of independent jobs has to be scheduled… (More)
  • table 1
Is this relevant?
1996
1996
A single-machine scheduling problem with precedence delays is analyzed. A set of n tasks is to be scheduled on the machine in… (More)
  • figure 5
  • figure 6
Is this relevant?