当前位置: X-MOL 学术Eur. J. Oper. Res. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
European Journal of Operational Research ( IF 6.0 ) Pub Date : 2023-05-13 , DOI: 10.1016/j.ejor.2023.05.018
Karim Tamssaouet , Stéphane Dauzère-Pérès

This article introduces a framework that unifies and generalizes well-known literature results related to local search for the job-shop and flexible job-shop scheduling problems. In addition to the choice of the metaheuristic and the neighborhood structure, the success of most of the influential local search approaches relies on the ability to quickly and efficiently rule out infeasible moves and evaluate the quality of the feasible neighbors. Hence, the proposed framework focuses on the feasibility and quality evaluation of a general move when solving the job-shop and flexible job-shop scheduling problems for any regular objective function. The proposed framework is valid for any scheduling problem where the defined neighborhood structure is appropriate, and each solution to the problem can be modeled with a directed acyclic graph with non-negative weights on nodes and arcs. The feasibility conditions and quality estimation procedures proposed in the literature rely heavily on information on the existence of a path between two nodes. Thus, based on an original parameterized algorithm that asserts the existence of a path between two nodes, novel generic procedures to evaluate the feasibility of a move and estimate the value of any regular objective function of a neighbor solution are proposed. We show that many well-known literature results are special cases of our results, which can be applied to a wide range of shop scheduling problems.



中文翻译:

作业车间通用高效邻域结构框架和灵活作业车间调度问题

本文介绍了一个框架,该框架统一并概括了与作业车间本地搜索和灵活作业车间调度问题相关的著名文献结果。除了元启发式和邻域结构的选择之外,大多数有影响力的局部搜索方法的成功依赖于快速有效地排除不可行的移动并评估可行邻域的质量的能力。因此,所提出的框架重点关注在解决任何常规目标函数的作业车间和灵活作业车间调度问题时一般移动的可行性和质量评估。所提出的框架对于定义的邻域结构合适的任何调度问题都有效,该问题的每个解决方案都可以使用节点和弧上具有非负权重的有向无环图进行建模。文献中提出的可行性条件和质量估计程序很大程度上依赖于两个节点之间路径是否存在的信息。因此,基于断言两个节点之间存在路径的原始参数化算法,提出了新的通用程序来评估移动的可行性并估计邻居解的任何常规目标函数的值。我们表明,许多著名的文献结果都是我们结果的特例,可以应用于广泛的车间调度问题。文献中提出的可行性条件和质量估计程序很大程度上依赖于两个节点之间路径是否存在的信息。因此,基于断言两个节点之间存在路径的原始参数化算法,提出了新的通用程序来评估移动的可行性并估计邻居解的任何常规目标函数的值。我们表明,许多著名的文献结果都是我们结果的特例,可以应用于广泛的车间调度问题。文献中提出的可行性条件和质量估计程序很大程度上依赖于两个节点之间路径是否存在的信息。因此,基于断言两个节点之间存在路径的原始参数化算法,提出了新的通用程序来评估移动的可行性并估计邻居解的任何常规目标函数的值。我们表明,许多著名的文献结果都是我们结果的特例,可以应用于广泛的车间调度问题。提出了新的通用程序来评估移动的可行性并估计邻居解的任何常规目标函数的值。我们表明,许多著名的文献结果都是我们结果的特例,可以应用于广泛的车间调度问题。提出了新的通用程序来评估移动的可行性并估计邻居解的任何常规目标函数的值。我们表明,许多著名的文献结果都是我们结果的特例,可以应用于广泛的车间调度问题。

更新日期:2023-05-13
down
wechat
bug