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

• 成果类型: Article
• 署名作者: Kasapidis, Gregory A.; Dauzere-Peres, Stephane; Paraskevopoulos, Dimitris C.; Repoussis, Panagiotis P.; Tarantilis, Christos D.
• 署名单位: University of Liverpool; Athens University of Economics & Business; IMT - Institut Mines-Telecom; Mines Saint-Etienne; Centre National de la Recherche Scientifique (CNRS); BI Norwegian Business School; City St Georges, University of London; Athens University of Economics & Business
• 刊物名称: PRODUCTION AND OPERATIONS MANAGEMENT
• ISSN/ISSBN: 1059-1478
• DOI: 10.1111/poms.13977
• 发表日期: 2023
• 页码: 2322-2330
• 关键词: arbitrary precedence graphs; constraint programming; flexible job shop scheduling; integer linear programming; multiple resources; nonlinear precedence constraints

摘要

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.