Job shop scheduling

Known as: Job-shop problem, Job-shop scheduling 
Job shop scheduling (or job-shop problem) is an optimization problem in computer science and operations research in which ideal jobs are assigned to… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1959-2018
020040019592018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
A new hybrid algorithm is introduced into solving job shop scheduling problems, which combines knowledge evolution algorithm(KEA… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Beam search is a heuristic method for solving optimization problems. It is an adaptation of the branch and bound method in which… (More)
Is this relevant?
1997
1997
The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n… (More)
  • table 7.1
  • figure 7.1
  • figure 7.2
  • figure 7.3
  • figure 7.4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We apply reinforce merit learning methods to learn domain-specific heuristics for job shop scheduling A repair-based scheduler… (More)
  • figure 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this… (More)
  • figure 2
  • figure 3
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
In this paper, we apply the tabu-search technique to the job-shop scheduling problem, a notoriously difficult problem in… (More)
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • table 2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
  • figure 1
  • table I
  • table II
  • table I
  • table II
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Scheduling deals with the allocation of resources over time to perform a collection of tasks. Scheduling problems arise in… (More)
  • figure 1-1
  • figure 2-1
  • figure 3-1
  • figure 3-2
  • figure 3-3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Consider the following generalization of the classical job-shop scheduling problem in which a set of machines is associated with… (More)
  • figure 1
  • figure 2
  • figure 5
Is this relevant?