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: | Woeginger Gerhard J., Chauhan Satyaveer S., Eremeev Anton V., Romanova Anna A., Servakh Vladimir V. |
Keywords: | combinatorial analysis |
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.