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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on industrial informatics Ročník 19; číslo 5; s. 6692 - 6705
Hlavní autori:	Zhao, Fuqing, Xu, Zesong, Wang, Ling, Zhu, Ningning, Xu, Tianpeng, Jonrinaldi, J.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 01.05.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
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!