A survey of job shop scheduling problem: The types and models
H Xiong, S Shi, D Ren, J Hu - Computers & Operations Research, 2022 - Elsevier
Job shop scheduling problem (JSSP) is a thriving area of scheduling research, which has
been concerned and studied widely by scholars in engineering and academic fields. This …
been concerned and studied widely by scholars in engineering and academic fields. This …
A hybrid algorithm with a new neighborhood structure for job shop scheduling problems
J Xie, X Li, L Gao, L Gui - Computers & Industrial Engineering, 2022 - Elsevier
Job shop scheduling problems (JSP) arise from the scheduling of modern manufacturing
enterprises. It is one of the most famous NP-complete problem. To evaluate the performance …
enterprises. It is one of the most famous NP-complete problem. To evaluate the performance …
A modified genetic algorithm with local search strategies and multi-crossover operator for job shop scheduling problem
It is not uncommon for today's problems to fall within the scope of the well-known class of NP-
Hard problems. These problems generally do not have an analytical solution, and it is …
Hard problems. These problems generally do not have an analytical solution, and it is …
[PDF][PDF] A state-of-the-art review of job-shop scheduling techniques
AS Jain, S Meeran - Workin paper, Department of applied physics …, 1998 - neuro.bstu.by
ABSTRACT A great deal of research has been focused on solving the job-shop problem
(ΠJ), over the last forty years, resulting in a wide variety of approaches. Recently, much effort …
(ΠJ), over the last forty years, resulting in a wide variety of approaches. Recently, much effort …
A hybrid genetic algorithm for the job shop scheduling problems
BJ Park, HR Choi, HS Kim - Computers & industrial engineering, 2003 - Elsevier
The Job Shop Scheduling Problem (JSSP) is one of the most general and difficult of all
traditional scheduling problems. The goal of this research is to develop an efficient …
traditional scheduling problems. The goal of this research is to develop an efficient …
An effective hybrid genetic algorithm for the job shop scheduling problem
C Zhang, Y Rao, P Li - The International Journal of Advanced …, 2008 - Springer
From the computational point of view, the job shop scheduling problem (JSP) is one of the
most notoriously intractable NP-hard optimization problems. This paper applies an effective …
most notoriously intractable NP-hard optimization problems. This paper applies an effective …
Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
Abstract The Job Shop Scheduling Problem (JSP) is an example of a combinatorial
optimization problem that has interested researchers for several decades. In this paper we …
optimization problem that has interested researchers for several decades. In this paper we …
Survey on genetic programming and machine learning techniques for heuristic design in job shop scheduling
Job shop scheduling (JSS) is a process of optimizing the use of limited resources to improve
the production efficiency. JSS has a wide range of applications, such as order picking in the …
the production efficiency. JSS has a wide range of applications, such as order picking in the …
A very fast TS/SA algorithm for the job shop scheduling problem
CY Zhang, PG Li, YQ Rao, ZL Guan - Computers & operations research, 2008 - Elsevier
The job shop scheduling problem (JSP) is one of the most notoriously intractable NP-
complete optimization problems. Over the last 10–15 years, tabu search (TS) has emerged …
complete optimization problems. Over the last 10–15 years, tabu search (TS) has emerged …
A hybrid algorithm based on a new neighborhood structure evaluation method for job shop scheduling problem
Job shop scheduling problem (JSP) which is widespread in the real-world production
system is one of the most general and important problems in various scheduling problems …
system is one of the most general and important problems in various scheduling problems …