Approximation of the supply scheduling problem

Approximation of the supply scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20051756
Country: Netherlands
Volume: 33
Issue: 3
Start Page Number: 249
End Page Number: 254
Publication Date: May 2005
Journal: Operations Research Letters
Authors: , , , ,
Keywords: combinatorial analysis
Abstract:

The supply scheduling problem consists in finding a minimum cost delivery plan from a set of providers to a manufacturing unit, subject to given bounds on the shipment sizes and subject to the demand at the manufacturing unit. We provide a fully polynomial time approximation scheme for this problem.

Reviews

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