On the multiresource flexible job-shop scheduling problem with arbitrary precedence graphs

PRODUCTION AND OPERATIONS MANAGEMENT(2023)

引用 5|浏览10
暂无评分
摘要
This paper aims at linking the work presented in Dauzere-Peres et al. (1998) and more recently in Kasapidis et al. (2021) on the multiresource flexible job-shop scheduling problem with nonlinear routes or equivalently with arbitrary precedence graphs. In particular, we present a mixed integer linear programming (MIP) model and a constraint programming (CP) model to formulate the problem. We also compare the theorems introduced in Dauzere-Peres et al. (1998) and Kasapidis et al. (2021) and propose a new theorem extension. Computational experiments were conducted to assess the efficiency and effectiveness of all propositions. Lastly, the proposed MIP and CP models are tested on benchmark problems of the literature and comparisons are made with state-of-the-art algorithms.
更多
查看译文
关键词
flexible job shop scheduling, mathematical programming, constraint programming, evolutionary algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要