A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems

Igor Averbakh and Oded Berman
Additional contact information
Igor Averbakh: Western Washington University, Bellingham, Washington
Oded Berman: University of Toronto, Toronto, Ontario, Canada

Operations Research, 1999, vol. 47, issue 1, 165-170

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

Keywords: approximations/heuristics; heuristic for routing-scheduling flow-shop (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.47.1.165 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:47:y:1999:i:1:p:165-170

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().