A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems

Authors
Averbakh, I Berman, O
Citation
I. Averbakh et O. Berman, A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems, OPERAT RES, 47(1), 1999, pp. 165-170
Citations number
18
Categorie Soggetti
Engineering Mathematics
Journal title
OPERATIONS RESEARCH
ISSN journal
0030364X → ACNP
Volume
47
Issue
1
Year of publication
1999
Pages
165 - 170
Database
ISI
SICI code
0030-364X(199901/02)47:1<165:ASHFMF>2.0.ZU;2-K
Abstract
We consider the routing-scheduling version of the flow-shop problem, where n jobs located at different nodes of a transportation network must be execu ted 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.