Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints
Modelling and solving a practical flexible job-shop scheduling problem with blocking constraints
复制标题
DOI：
10.1080/00207541003733775
复制
发表时间：
2011-04
影响因子：
9.2
通讯作者：
Yazid Mati;C. Lahlou;S. Dauzére-Pérés
中科院分区：
文献类型：
--
作者：
Yazid Mati;C. Lahlou;S. Dauzére-Pérés
本文研究了在帮助企业设计新的生产车间时，一个实际的作业车间调度问题的建模和求解。问题的主要特点是一些资源是灵活的，必须考虑阻塞约束。对问题和解决问题的动机进行了详细的阐述。描述了问题的建模和所提出的求解方法--遗传算法。给出了用真实数据进行的数值实验，并进行了分析。我们还展示了如何使用这些结果来支持研讨会设计中的选择。
This paper presents a study of a practical job-shop scheduling problem modelled and solved when helping a company to design a new production workshop. The main characteristics of the problem are that some resources are flexible, and blocking constraints have to be taken into account. The problem and the motivation for solving it are detailed. The modelling of the problem and the proposed resolution approach, a genetic algorithm, are described. Numerical experiments using real data are presented and analysed. We also show how these results were used to support choices in the design of the workshop.