A probabilistic analysis of the multi-period single-sourcing problem

DOI10.1016/S0166-218X(00)00320-6MaRDI QIDQ5946827zbMATH OpenOpenAlexFDO

Authors H. Edwin Romeijn, Dolores Romero Morales

Publication date 30 July 2002

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(00)00320-6

zbMATH Keywords

dynamic assignment problemgeneralized assignment problemprobabilistic analysis

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Review text

In the multi-period single-sourcing problem one has to minimize the inventory and transportation costs in an assignment of customers to warehouses such that each customer is assigned to exactly one warehouse in each time period subject to given capacity constraints. The authors investigate a general stochastic model of this task. The probabilistic analysis of the proposed model is given and the theoretical results are empirically illustrated.

Recommendations

• Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case
• The stochastic transportation problem with single sourcing
• An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
• scientific article; zbMATH DE number 1816803
• On solving the multi-period single-sourcing problem under uncertainty

Cites work

• A class of generalized greedy algorithms for the multi-knapsack problem
• A class of greedy algorithms for the generalized assignment problem
• A Concentration Inequality for the K-Median Problem
• A probabilistic analysis of the capacitated facility location problem
• A probabilistic feasibility and value analysis of the generalized assignment problem
• An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
• Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case
• Designing distribution systems with transport economies of scale
• Generating Experimental Data for the Generalized Assignment Problem
• scientific article; zbMATH DE number 1128822 (Why is no real title available?)
• scientific article; zbMATH DE number 947476 (Why is no real title available?)
• scientific article; zbMATH DE number 3193293 (Why is no real title available?)
• Multi-criteria analysis with partial information about the weighting coefficients
• Multicommodity Distribution System Design by Benders Decomposition
• On rates of convergence and asymptotic normality in the multiknapsack problem
• Parallel machine scheduling, linear programming, and parameter list scheduling heuristics
• Probabilistic analyses and practical algorithms for inventory-routing models
• Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
• Probabilistic Analysis of a Generalized Bin Packing Problem and Applications
• Probabilistic analysis of the generalised assignment problem
• Probabilistic analysis of the minimum weighted flowtime scheduling problem
• Probability inequalities for empirical processes and a law of the iterated logarithm
• Sharper bounds for Gaussian and empirical processes

Cited in

(13)

• On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty
• Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case
• A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements
• The stochastic transportation problem with single sourcing
• Cross-facility management of production and transportation planning problem
• Dantzig-Wolfe decomposition for the facility location and production planning problem
• A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints
• scientific article; zbMATH DE number 1816803 (Why is no real title available?)
• An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
• The continuous-time single-sourcing problem with capacity expansion opportunities
• Exact algorithms for integrated facility location and production planning problems
• A multi-period inventory model with multi-dimensional procurement bidding
• On solving the multi-period single-sourcing problem under uncertainty

This page was built for publication: A probabilistic analysis of the multi-period single-sourcing problem

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