Necessary and Sufficient Conditions for Feasible Neighbourhood Solutions in the Local Search of the Job-Shop Scheduling Problem

Necessary and Sufficient Conditions for Feasible Neighbourhood Solutions in the Local Search of the Job-Shop Scheduling Problem

Abstract The meta-heuristic algorithm with local search is an excellent choice for the job-shop scheduling problem (JSP). However, due to the unique nature of the JSP, local search may generate infeasible neighbourhood solutions. In the existing literature, although some domain knowledge of the JSP...

Full description

Bibliographic Details
Main Authors: Lin Gui, Xinyu Li, Liang Gao, Cuiyu Wang
Format: Article
Language:English
Published: SpringerOpen 2023-08-01
Series:Chinese Journal of Mechanical Engineering
Subjects:
Scheduling
Job-shop scheduling
Local search
Neighbourhood structure
Domain knowledge
Online Access:https://doi.org/10.1186/s10033-023-00911-8

Internet

https://doi.org/10.1186/s10033-023-00911-8

Similar Items