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

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

0.00 Avg rating—0 Votes
Article ID: iaor2001690
Country: United States
Volume: 47
Issue: 1
Start Page Number: 165
End Page Number: 170
Publication Date: Jan 1999
Journal: Operations Research
Authors: ,
Keywords: scheduling
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.

Reviews

Required fields are marked *. Your email address will not be published.