Asymptotically optimal schedules for single-server flow shop problems with setup costs and times

Asymptotically optimal schedules for single-server flow shop problems with setup costs and times

0.00 Avg rating—0 Votes
Article ID: iaor2006805
Country: Netherlands
Volume: 33
Issue: 4
Start Page Number: 421
End Page Number: 430
Publication Date: Jul 2005
Journal: Operations Research Letters
Authors: ,
Keywords: networks: scheduling
Abstract:

We consider the processing of M jobs in a flow shop with N stations in which only a single server is in charge of all stations. We demonstrate that for the objective of minimizing the total setup and holding cost, a class of easily implementable schedules is asymptotically optimal.

Reviews

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