QR koda

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...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
Principais autores: Lin Gui, Xinyu Li, Liang Gao, Cuiyu Wang
Format: Artigo
Jezik:Inglês
Izdano: KeAi Communications Co., Ltd. 2023-08-01
Serija:Chinese Journal of Mechanical Engineering
Teme:
Online dostop:https://doi.org/10.1186/s10033-023-00911-8
Oznake: Označite
Brez oznak, prvi označite!