Computational complexity of finding Pareto efficient outcomes for biobjective lot-sizing models
In this article, we study a biobjective economic lot-sizing problem with applications, among others, in green logistics. The first objective aims to minimize the total lot-sizing costs including production and inventory holding costs, whereas the second one minimizes the maximum production and inventory block expenditure. We derive (almost) tight complexity results for the Pareto efficient outcome problem under nonspeculative lot-sizing costs. First, we identify nontrivial problem classes for which this problem is polynomially solvable. Second, if we relax any of the parameter assumptions, we show that (except for one case) finding a single Pareto efficient outcome is an N P -hard task in general. Finally, we shed some light on the task of describing the Pareto frontier.
|Keywords||biobjective, complexity analysis, expenditure, lot-sizing, Pareto efficient outcomes|
|Persistent URL||dx.doi.org/10.1002/nav.21590, hdl.handle.net/1765/84793|
|Journal||Naval Research Logistics: an international journal|
Romeijn, H.E, Morales, D.R, & van den Heuvel, W. (2014). Computational complexity of finding Pareto efficient outcomes for biobjective lot-sizing models. Naval Research Logistics: an international journal, 61(5), 386–402. doi:10.1002/nav.21590