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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE access Ročník 6; s. 78666 - 78677
Hlavní autori:	Lin, Shih-Wei, Lu, Chung-Cheng, Ying, Kuo-Ching
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!