Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models

H. Edwin Romeijn, Dolores Romero Morales and Wilco van den Heuvel

Naval Research Logistics (NRL), 2014, vol. 61, issue 5, 386-402

Abstract: 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. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 386–402, 2014

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

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

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:61:y:2014:i:5:p:386-402

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 ().