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

作     者：Kasapidis, Gregory A. Dauzere-Peres, Stephane Paraskevopoulos, Dimitris C. Repoussis, Panagiotis P. Tarantilis, Christos D. 

作者机构：Univ Liverpool Management Sch Dept Operat & Supply Chain Management Liverpool Merseyside England Athens Univ Econ & Business Sch Business Dept Management Sci & Technol Athens Greece CNRS Mines St Etienne Dept Mfg Sci & Logist UMR LIMOS 6158 Gardanne France BI Norwegian Business Sch Dept Accounting & Operat Management Oslo Norway City Univ London Bayes Business Sch London England Athens Univ Econ & Business Sch Business Dept Mkt & Commun Athens Greece 

出 版 物：《PRODUCTION AND OPERATIONS MANAGEMENT》 (生产与运营管理)

年 卷 期：2023年第32卷第7期

页      面：2322-2330页

核心收录：

学科分类：12[管理学] 120202[管理学-企业管理（含：财务管理、市场营销、人力资源管理）] 0202[经济学-应用经济学] 02[经济学] 1202[管理学-工商管理] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0802[工学-机械工程] 

主　　题：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.