Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs
From MaRDI portal
Publication:5189007
DOI10.1287/opre.1080.0622zbMath1181.90021OpenAlexW2094141022MaRDI QIDQ5189007
Esaignani Selvarajah, George Steiner
Publication date: 6 March 2010
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1080.0622
Related Items (9)
A time scheduling model of logistics service supply chain with mass customized logistics service ⋮ Manufacturing rescheduling after crisis or disaster-caused supply chain disruption ⋮ Integrated scheduling on a batch machine to minimize production, inventory and distribution costs ⋮ A scheduling model of logistics service supply chain based on the time windows of the FLSP's operation and customer requirement ⋮ Supply chain scheduling to minimize holding costs with outsourcing ⋮ Cost allocation in rescheduling with machine unavailable period ⋮ Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains ⋮ Integrated scheduling of production and distribution for manufacturers with parallel batching facilities ⋮ An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time
This page was built for publication: Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs
