Approximate queueing models for capacitated multi-stage inventory systems under base-stock control

Date

2014-07-01

Author

Avşar, Zeynep Müge

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

233
views

0
downloads

A queueing analysis is presented for base-stock controlled multi-stage production-inventory systems with capacity constraints. The exact queueing model is approximated by replacing some state-dependent conditional probabilities (that are used to express the transition rates) by constants. Two recursive algorithms (each with several variants) are developed for analysis of the steady-state performance. It is analytically shown that one of these algorithms is equivalent to the existing approximations given in the literature. The system studied here is more general than the systems studied in the literature. The numerical investigation for three-stage systems shows that the proposed approximations work well to estimate the relevant performance measures.

Subject Keywords

Management Science and Operations Research, Modelling and Simulation, Information Systems and Management

URI

https://hdl.handle.net/11511/38333

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

DOI

https://doi.org/10.1016/j.ejor.2013.12.046

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A conic quadratic formulation for a class of convex congestion functions in network flow problems Gürel, Sinan (Elsevier BV, 2011-06-01) In this paper we consider a multicommodity network flow problem with flow routing and discrete capacity expansion decisions. The problem involves trading off congestion and capacity assignment (or expansion) costs. In particular, we consider congestion costs involving convex, increasing power functions of flows on the arcs. We first observe that under certain conditions the congestion cost can be formulated as a convex function of the capacity level and the flow. Then, we show that the problem can be effici...
A NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM KIRCA, O; KOKTEN, M (Elsevier BV, 1994-06-09) In this paper a framework for a new heuristic approach for solving the single level multi-item capacitated dynamic lot sizing problem is presented. The approach uses an iterative item-by-item strategy for generating solutions to the problem. In each iteration a set of items are scheduled over the planning horizon and the procedure terminates when all items are scheduled. An algorithm that implements this approach is developed in which in each iteration a single item is selected and scheduled over the planni...
An efficient algorithm for the capacitated single item dynamic lot size problem Kırca, Ö. (Elsevier BV, 1990-3) A dynamic programming based algorithm is developed for the single item lot size problem with concave costs and arbitrary capacities. By making use of the extreme point properties of the problem, first the set of all feasible cumulative production levels that may occur in an optimal solution is generated. In the second stage, a dynamic programming procedure is carried out over this set. The worst case computational effort is equal to that of the standard dynamic programming approach but extensive computation...
AN APPROACH FOR FINDING THE MOST PREFERRED ALTERNATIVE IN THE PRESENCE OF MULTIPLE CRITERIA Köksalan, Mustafa Murat; TANER, OV (Elsevier BV, 1992-07-10) An interactive approach for discrete multiple criteria decision making problems is developed. The approach requires the decision maker to compare pairs of presented alternatives. These alternatives may be existing alternatives or dummy alternatives created from existing alternatives. Inferior alternatives are sequentially eliminated by either using the responses of the decision maker directly or by constructing cones of inferior solutions based on these responses. The approach converges to the most preferre...
Measures of dynamism and urgency in logistics van Lon, Rinde R. S.; Ferrante, Eliseo; Turgut, Ali Emre; Wenseleers, Tom; Vanden Berghe, Greet; Holvoet, Tom (Elsevier BV, 2016-09-16) Dynamism was originally defined as the proportion, of online versus offline orders in the literature on dynamic logistics. Such a definition however, loses meaning when considering purely dynamic problems where all customer requests arrive dynamically. Existing measures of dynamism are limited to either (1) measuring the proportion of online versus offline orders or (2) measuring urgency, a concept that is orthogonal to dynamism, instead. The present paper defines separate and independent formal definidons ...

Citation Formats

Z. M. Avşar, “Approximate queueing models for capacitated multi-stage inventory systems under base-stock control,” EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, pp. 135–146, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38333.