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

DOI10.1002/nav.21590zbMath1411.90037OpenAlexW1799974124MaRDI QIDQ4632846

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

Publication date: 2 May 2019

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

Full work available at URL: http://hdl.handle.net/2027.42/108049

zbMATH Keywords

complexity analysisexpenditurelot-sizingbiobjectivePareto efficient outcomes

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Inventory, storage, reservoirs (90B05)

Related Items (5)

The single-item green lot-sizing problem with fixed carbon emissions ⋮ Dual-mode production planning for manufacturing with emission constraints ⋮ Solving a constrained economic lot size problem by ranking efficient production policies ⋮ The trade-off between costs and carbon emissions from economic lot-sizing decisions ⋮ Impact of coordination on costs and carbon emissions for a two-echelon serial economic order quantity problem

This page was built for publication: Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models