Total shipping cost/completion-date trade-off in transportation problem with additional restriction

DOI10.1080/09720502.1998.10700251zbMath0923.90057OpenAlexW2071061170MaRDI QIDQ4248048

Preetvanti Singh, P. K. Saxena

Publication date: 3 June 1999

Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720502.1998.10700251

zbMATH Keywords

trade-offtime minimizing transportation problemcost minimizing transportation problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

The multiple objective time transportation problem with additional restrictions

Cites Work

• Efficiency and time-cost-tradeoffs in transportation problems
• Bicriteria Transportation Problem
• Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
• Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem
• Problems and methods with multiple objective functions

This page was built for publication: Total shipping cost/completion-date trade-off in transportation problem with additional restriction