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

Olles dieđut

Bibliográfalaš dieđut

Váldodahkkit:	Lin Gui, Xinyu Li, Liang Gao, Cuiyu Wang
Materiálatiipa:	Artigo
Giella:	Inglês
Almmustuhtton:	KeAi Communications Co., Ltd. 2023-08-01
Ráidu:	Chinese Journal of Mechanical Engineering
Fáttát:	Scheduling Job-shop scheduling Local search Neighbourhood structure Domain knowledge
Liŋkkat:	https://doi.org/10.1186/s10033-023-00911-8
Fáddágilkorat:	Lasit fáddágilkoriid Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!