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

DOI10.1002/NAV.21590MaRDI QIDQ4632846zbMATH OpenOpenAlexFDO

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

Publication date 2 May 2019

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

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

zbMATH Keywords

biobjectivecomplexity analysisexpenditurelot-sizingPareto efficient outcomes

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1530340
• Small approximate Pareto sets for biobjective shortest paths and other problems
• scientific article; zbMATH DE number 4070651
• Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
• The economic lot-sizing problem with an emission capacity constraint

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632846)