← Search

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

Gregory A. Kasapidis^1,2; Stéphane Dauzère‐Pérès^3,4; Dimitris C. Paraskevopoulos⁵; Panagiotis P. Repoussis⁶; Christos D. Tarantilis²

¹ Department of Operations and Supply Chain Management, Management School, University of Liverpool, Liverpool, UK · ² Department of Management Science and Technology, School of Business, Athens University of Economics and Business, Athens, Greece · ³ Department of Manufacturing Sciences and Logistics, Mines Saint‐Etienne, CNRS, UMR 6158 LIMOS, Gardanne, France · ⁴ Department of Accounting and Operations Management BI Norwegian Business School Oslo Norway · ⁵ Bayes Business School (formerly Cass), City, University of London, London, UK · ⁶ Department of Marketing and Communication, School of Business, Athens University of Economics and Business, Athens, Greece

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.

DOI

10.1111/poms.13977

Volume

32 (7)

Pages

2322-2330

Language

en

Export

BibTeX

Sources

crossref openalex