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

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