A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
Operations Research · 1999 · Volume 47 · Issue 1
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
Enable JavaScript for citation tools and additional paper interactions.