文章基本信息

标题：Minimizing the cycle time in the distributed flow shop scheduling problem
本地全文：下载
作者：Jarosław Pempera ; Czesław Smutnicki ; Robert Wójcik 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2021
卷号：54
期号：1
页码：1081-1086
DOI：10.1016/j.ifacol.2021.08.203
语种：English
出版社：Elsevier
摘要：AbstractWe deal with the problem of cyclic scheduling tasks in the distributed manufacturing system with factories having the flow shop layout. The optimization aim is to minimize the cycle time. We have proposed the proprietary model and introduced some special properties of the problem, which allow us to find the cycle time for each given particular solution quickly. Since the formulated problem is NP-hard, we propose a metaheuristic algorithm based on the tabu search approach. The quality of the algorithm has been verified experimentally on common benchmarks and compared to other methods known in the literature, namely the scatter search and list scheduling. The problem also has a relation with the problem of balancing workloads of identical parallel production lines.
关键词：Keywordscycle timedistributed flow shop problemtabu search algorithm