Journal
PRODUCTION AND OPERATIONS MANAGEMENT
Volume 32, Issue 7, Pages 2322-2330Publisher
WILEY
DOI: 10.1111/poms.13977
Keywords
arbitrary precedence graphs; constraint programming; flexible job shop scheduling; integer linear programming; multiple resources; nonlinear precedence constraints
Ask authors/readers for more resources
This paper aims to connect 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. The authors propose a mixed integer linear programming (MIP) model and a constraint programming (CP) model to formulate the problem. They 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.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available