Network DEA-based biobjective optimization of product flows in a supply chain

DOI10.1007/s10479-017-2653-6zbMath1391.90349OpenAlexW2763502480MaRDI QIDQ1639292

Sebastián Lozano, Belarmino Adenso-Díaz

Publication date: 12 June 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2653-6

zbMATH Keywords

supply chaincost and losses minimizationNDEAspoilageweighted Tchebycheff

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Inventory, storage, reservoirs (90B05)

Related Items (4)

Cross-country comparison of the efficiency of the European forest sector and second stage DEA approach ⋮ DEA‐based centralized resource allocation with network flows ⋮ A new branch and efficiency algorithm for an optimal design of the supply chain network in view of resilience, inequity and traffic congestion ⋮ Multiobjective centralized DEA approach to Tokyo 2020 Olympic Games

Uses Software

• RELAX4

Cites Work

• Unnamed Item
• Unnamed Item
• Network data envelopment analysis: a review
• Further study of production possibility set and performance evaluation model in supply chain DEA
• Survey of multi-objective optimization methods for engineering
• Supply chain DEA: production possibility set and performance evaluation model
• A DEA game model approach to supply chain efficiency
• DEA models for supply chain efficiency evaluation
• Network DEA: A slacks-based measure approach
• Supply chain performance evaluation with data envelopment analysis and balanced scorecard approach
• A branch and efficiency algorithm for the optimal design of supply chain networks
• A new benchmarking approach in cold chain
• Modeling the synergy level in a vertical collaborative supply chain through the IMP interaction model and DEA framework
• Evaluation of Supply Chain Efficiency Based on a Novel Network of Data Envelopment Analysis Model
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• An interactive weighted Tchebycheff procedure for multiple objective programming

This page was built for publication: Network DEA-based biobjective optimization of product flows in a supply chain