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

وصف كامل

التفاصيل البيبلوغرافية
الحاوية / القاعدة:Chinese Journal of Mechanical Engineering
المؤلفون الرئيسيون: Lin Gui, Xinyu Li, Liang Gao, Cuiyu Wang
التنسيق: مقال
اللغة:الإنجليزية
منشور في: SpringerOpen 2023-08-01
الموضوعات:
Scheduling
Job-shop scheduling
Local search
Neighbourhood structure
Domain knowledge
الوصول للمادة أونلاين:https://doi.org/10.1186/s10033-023-00911-8

الانترنت

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

مواد مشابهة