A Population-Based Iterated Greedy Algorithm for Distributed Assembly No-Wait Flow-Shop Scheduling Problem

This article investigates a distributed assembly no-wait flow-shop scheduling problem (DANWFSP), which has important applications in manufacturing systems. The objective is to minimize the total flowtime. A mixed-integer linear programming model of DANWFSP with total flowtime criterion is proposed....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on industrial informatics Jg. 19; H. 5; S. 6692 - 6705
Hauptverfasser:	Zhao, Fuqing, Xu, Zesong, Wang, Ling, Zhu, Ningning, Xu, Tianpeng, Jonrinaldi, J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 01.05.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Acceptance criteria Algorithms Assembly Distributed assembly scheduling Greedy algorithms Integer programming iterated greedy algorithm Job shop scheduling Linear programming Mixed integer no-wait flow-shop Processor scheduling Production facilities Search methods Search problems Sociology Statistics total flowtime
ISSN:	1551-3203, 1941-0050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!