Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
The job-shop scheduling problem (JSSP) is a well-known difficult combinatorial optimization problem. Many algorithms have been… 
2006
2006
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic… 
Highly Cited
2002
Highly Cited
2002
Owing to the increasing impact of some environmental factors on manufacturing firms' performance, in the past few years growing… 
Review
1999
Review
1999
In this paper, the job shop scheduling problem is considered with the objective of minimization of makespan time. We first… 
1996
1996
  • Wu YingLi Bin
  • 1996
  • Corpus ID: 60499216
Job-shop scheduling, a typical NP-complete problem, is an important step in planning and manufacturing control of CIMS… 
1996
1996
Large scale job scheduling problems are addressed in this paper through a divide and conquer scheme. With the scheme, a job shop… 
1990
1990
Abstract Job-shop scheduling has challenged many researchers in that, although it belongs to a class of problems amenable to… 
Highly Cited
1986
Highly Cited
1986
This paper deals with operation scheduling on machines in a job shop. The jobs which consist of a set of related operations are… 
1986
1986
The first part of this paper is devoted to the presentation of a software system for jobshop scheduling of batches under due date… 
1975
1975
This paper reports on the results of various experi ments with the loading rule SIx for scheduling jobs and compares its…