Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop

This paper presents a cloud theory-based iterated greedy (CTIG) algorithm for solving the no-wait flowshop scheduling problem (NWFSP) with the objective of minimizing the sum of makespan and total weighted tardiness. The performance of the proposed CTIG algorithm is evaluated by comparing its comput...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE access Jg. 6; S. 78666 - 78677
Hauptverfasser:	Lin, Shih-Wei, Lu, Chung-Cheng, Ying, Kuo-Ching
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms cloud theory-based iterated greedy algorithm Computing time Flowcharts Greedy algorithms Heuristic methods Indexes Industries Job shop scheduling Job shops metaheuristics no-wait flowshop Particle swarm optimization Scheduling Single machine scheduling Urban areas
ISSN:	2169-3536, 2169-3536
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!