A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems
成果类型：
Article
署名作者：
Averbakh, I; Berman, O
署名单位：
Western Washington University; University of Toronto
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.47.1.165
发表日期：
1999
页码：
165-170
关键词：
摘要：
We consider the routing-scheduling version of the flow-shop problem, where n jobs located at different nodes of a transportation network must be executed by m machines (servers) travelling between the jobs,The objective is to minimize the makespan. For this problem, we present a simple heuristic and analyze its worst-case performance.