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

Gregory A. Kasapidis, Stéphane Dauzère‐Pérès, Dimitris C. Paraskevopoulos, Panagiotis P. Repoussis and Christos D. Tarantilis

Production and Operations Management, 2023, vol. 32, issue 7, 2322-2330

Abstract: This paper aims at linking the work presented in Dauzère‐Pérès 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 Dauzère‐Pérès 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.

Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1111/poms.13977

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:popmgt:v:32:y:2023:i:7:p:2322-2330

Ordering information: This journal article can be ordered from
http://onlinelibrary ... 1111/(ISSN)1937-5956

Access Statistics for this article

Production and Operations Management is currently edited by Kalyan Singhal

More articles in Production and Operations Management from Production and Operations Management Society
Bibliographic data for series maintained by Wiley Content Delivery ().