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

DOI10.1002/nav.20276zbMath1233.90069OpenAlexW2065723447MaRDI QIDQ3169250

Mikhail Y. Kovalyov, Chi To Ng, Cheng, T. C. Edwin

Publication date: 28 April 2011

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20276

zbMATH Keywords

combinatorial optimizationapproximation schemeFPTASsupply chain scheduling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (3)

Lot-size scheduling of a single product on unrelated parallel machines ⋮ A strongly polynomial FPTAS for the symmetric quadratic knapsack problem ⋮ Approximate solution of the control problem of supplies with many intervals and concave cost functions

Cites Work

• Unnamed Item

This page was built for publication: An FPTAS for a supply scheduling problem with non-monotone cost functions