Kasapidis, G. A., Dauzère-Pérèz, S., Paraskevopoulos, D. C. ORCID: 0000-0002-7004-3263 , Repoussis, P. P. & Tarantilis, C. D. (2023).
On the Multi-Resource Flexible Job-Shop Scheduling Problem with Arbitrary Precedence Graphs.
Production and Operations Management,
doi: 10.1111/poms.13977
Abstract
This paper aims at linking the work presented in Dauz`ere-P´er`es et al. (1998) and more recently in Kasapidis et al. (2021) on the multi-resource flexible job-shop scheduling problem with non-linear routes or equivalently with arbitrary precedence graphs. In particular, we present a Mixed Integer Linear Programming model and a Constraint Programming model, to formulate the problem. We also compare the theorems introduced in Dauz`ere-P´er`es 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.
Publication Type: | Article |
---|---|
Additional Information: | This is the peer reviewed version of the following article: Kasapidis, G. A., Dauzère-Pérèz, S., Paraskevopoulos, D. C. view all authors (2023). On the Multi-Resource Flexible Job-Shop Scheduling Problem with Arbitrary Precedence Graphs. Production and Operations Management, to be published in final form at https://onlinelibrary.wiley.com/journal/19375956. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. This article may not be enhanced, enriched or otherwise transformed into a derivative work, without express permission from Wiley or by statutory rights under applicable legislation. Copyright notices must not be removed, obscured or modified. The article must be linked to Wiley’s version of record on Wiley Online Library and any embedding, framing or otherwise making available the article or pages thereof by third parties from platforms, services and websites other than Wiley Online Library must be prohibited. |
Publisher Keywords: | Flexible Job shop scheduling, multiple resources, integer linear programming, constraint programming, non-linear precedence constraints, arbitrary precedence graphs |
Subjects: | H Social Sciences > HD Industries. Land use. Labor H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management |
Departments: | Bayes Business School > Management |
![]() |
Text
- Accepted Version
This document is not freely accessible due to copyright restrictions. To request a copy, please use the button below. Request a copy |
Export
Downloads
Downloads per month over past year