Integrated job-shop scheduling in an FMS with heterogeneous transporters: MILP formulation, constraint programming, and branch-and-bound

Current studies on scheduling of machines and transporters assume that either a single transporter or an infinite number of homogeneous transporters such as AGVs or mobile robots are available to transport semi-finished jobs, which seems very restrictive in practice. This paper addresses this gap by...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of production research Jg. 62; H. 9; S. 3288 - 3304
Hauptverfasser:	Ahmadi-Javid, Amir, Haghi, Maryam, Hooshangi-Tabrizi, Pedram
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London Taylor & Francis 02.05.2024 Taylor & Francis LLC
Schlagworte:	AGVS Algorithms constraint programming (CP) Flexible manufacturing systems Impact analysis Integer programming Job shop scheduling Job shops Job-shop scheduling; flexible manufacturing system (FMS) Linear programming minimal time lags Mixed integer mixed-integer linear programming (MILP) mobile robots and automated guided vehicles (AGVs) Scheduling structure-based branch-and-bound (B&B)
ISSN:	0020-7543, 1366-588X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!