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

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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Production and operations management 2023-07, Vol.32 (7), p.2322-2330
Hauptverfasser:	Kasapidis, Gregory A., Dauzère‐Pérès, Stéphane, Paraskevopoulos, Dimitris C., Repoussis, Panagiotis P., Tarantilis, Christos D.
Format:	Artikel
Sprache:	eng
Schlagworte:	arbitrary precedence graphs Computer Science constraint programming flexible job shop scheduling integer linear programming multiple resources nonlinear precedence constraints Operations Research
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!