Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Cloud computing provides effective mechanisms for distributing the computing tasks to the virtual resources. To provide cost… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2016
Review
2016
In the last 25 years, extensive research has been carried out addressing the flexible job shop scheduling (JSS) problem. A… Expand
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Scheduling for the flexible job-shop is very important in both fields of production management and combinatorial optimization… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper presents a hybrid genetic algorithm for the job shop scheduling problem. The chromosome representation of the problem… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We apply reinforcement learning methods to learn domain-specific heuristics for job shop scheduling. A repair-based scheduler… Expand
  • figure 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The study of natural processes has inspired several heuristic optimization algorithms which have proved to be very effective in… Expand
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… Expand
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • table 2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We describe an approximation algorithm for the problem of finding the minimum makespan in a job shop. The algorithm is based on… Expand
  • figure 1
  • table I
  • table II
  • table I
  • table II
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The job-shop scheduling problem is a notoriously difficult problem in combinatorial optimization. Although even modest sized… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We describe an approximation method for solving the minimum makespan problem of job shop scheduling. It sequences the machines… Expand
Is this relevant?