W develop an approximation scheme for performance evaluation of serial supply systems when each stage operates like a single-server queue, and its planned inventories are managed according to a base-stock policy. We also present a near-exact matrix-geometric procedure for benchmarking our approximation relative to two other methods proposed in the literature. Through numerical tests, we demonst...

Matching problems involve a set of participants, where each participant has a capacity and a subset of the participants rank a subset of the others in order of preference (strictly or with ties). Matching problems are motivated in practice by large-scale applications, such as automated matching schemes, which assign participants together based on their preferences over one another. This thesis ...

Supply chain design problems can be analyzed as cooperative linear production games. The maximal total payoff and the optimal coalition of a “market responsive” supply network can be obtained from the solution of the mixed-variables Linear Programming problem. Then, using duality theory, the “Owen set” can be constructed in order to allocate the payoff among the members of the optimal coalition...

We consider the problem of finding a popular matching in the Capacitated House Allocation problem (CHA). An instance of CHA involves a set of agents and a set of houses. Each agent has a preference list in which a subset of houses are ranked in strict order, and each house may be matched to a number of agents that must not exceed its capacity. A matching M is popular if there is no other matchi...

We address several aspects related to managing re-entrant lines in a uni ed manner { capacity allocation, inventory management and production control. Our approach to study these systems is through simulation based optimization. Simulation o ers the exibility to model the complexities adequately while the gradient computation (via In nitesimal Perturbation Analysis) helps identify good solution...

This research develops a clustering-based location-allocation method to the Capacitated Facility Location Problem (CFLP), which provides an approximate optimal solution to determine the location and coverage of a set of facilities to serve the demands of a large number of locations. The allocation is constrained by facility capacities – different facilities may have different capacities and the...

This paper investigates a capacitated planar location-allocation problem with facility fixed cost. A zonebased fixed cost which consists of production and installation costs is considered. A nonlinear and mixed integer formulation is first presented. A powerful three stage Cross Entropy meta-heuristic with novel density functions is proposed. In the first stage a covering location problem provi...

We consider the robust single-source capacitated facility location problem with uncertainty in customer demands. A cardinality-constrained set is assumed for problem. To solve it efficiently, we propose an allocation-based formulation derived by Dantzig–Wolfe decomposition and a branch-and-price algorithm. The computational experiments show that our algorithm outperforms CPLEX many cases, which...

In this survey, we examine an important class of facility location problems known as the multisource Weber problem (also referred to as the continuous location-allocation problem). We also show how recent advances in the use of metaheuristic rules have significantly improved the ability to solve problems of this type. The new solution methods are discussed for both the well known multisource W...

The efficient design/redesign of the logistics network is essential for companies to maintain their competitive advantage. This paper presents a novel non-linear mixedinteger programming model for the multi-product capacitated location routing inventory problem (MPCLRIP), where a two-layer distribution system consisting of depots and customers was studied. The supply decisions such as location ...