An FPTAS for a supply scheduling problem with non‐monotone cost functions

Chi To Ng, Mikhail Yakovlevich Kovalyov and Tai Chiu Edwin Cheng

Naval Research Logistics (NRL), 2008, vol. 55, issue 3, 194-199

Abstract: Chauhan et al. Oper Res Lett 33 (2005), 249–254 presented a fully polynomial time approximation scheme (FPTAS) for a supply scheduling problem, which is to minimize a total cost associated with the sizes of deliveries from several providers to one manufacturer. The cost functions are assumed non‐decreasing and their arguments are assumed continuously divisible. In this note, we give a motivation for considering the case of non‐monotone cost functions with continuously divisible or discrete arguments. For this more general case, we suggest a modification of the FPTAS in [Chauhan et al., Oper Res Lett 33 (2005), 249–254]. We also suggest a different FPTAS to handle concave cost functions. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/nav.20276

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:55:y:2008:i:3:p:194-199

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().