An approximation for kanban controlled assembly systems

Date

2011-01-01

Author

TOPAN, Engin
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

83
views

0
downloads

An approximation is proposed to evaluate the steady-state performance of kanban controlled two-stage assembly systems. The development of the approximation is as follows. The considered continuous-time Markov chain is aggregated keeping the model exact, and this aggregate model is approximated replacing some state-dependent transition rates with constant rates. The approximate aggregate model is, then, decomposed into submodels and a product-form steady-state distribution is obtained for each submodel. Finally, the submodels are combined in such a way that the size of the problem becomes independent of the number of kanbans. This leads to the computational advantage in solving the combined model using numerical matrix-geometric solution algorithms. Numerical comparisons of the combined model with simulation, exact model, approximate aggregate model and an approximation in the literature show that the proposed approximation performs well in terms of accuracy and computational burden.

Subject Keywords

Management Science and Operations Research, General Decision Sciences

URI

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

Journal

ANNALS OF OPERATIONS RESEARCH

DOI

https://doi.org/10.1007/s10479-009-0560-1

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An approximate model for kanban controlled assembly systems Topan, Engin; Avşar, Zeynep Müge; Department of Industrial Engineering (2005) In this thesis, an approximation is proposed to evaluate the steady-state performance of kanban controlled assembly systems. The approximation is developed for the systems with two components making up an assembly. Then, it is extended to systems with more than two components. A continuous-time Markov model is aggregated keeping the model exact, and this aggregate model is approximated replacing some state-dependent transition rates with constant rates. Decomposition of the approximate aggregate model into ...
An interactive algorithm to find the most preferred solution of multi-objective integer programs LOKMAN, BANU; Köksalan, Mustafa Murat; Korhonen, Pekka J.; Wallenius, Jyrki (Springer Science and Business Media LLC, 2016-10-01) In this paper, we develop an interactive algorithm that finds the most preferred solution of a decision maker (DM) for multi-objective integer programming problems. We assume that the DM's preferences are consistent with a quasiconcave value function unknown to us. Based on the properties of quasiconcave value functions and pairwise preference information obtained from the DM, we generate constraints to restrict the implied inferior regions. The algorithm continues iteratively and guarantees to find the mos...
Anti-periodic solutions for state-dependent impulsive recurrent neural networks with time-varying and continuously distributed delays Sayli, Mustafa; YILMAZ, ENES (Springer Science and Business Media LLC, 2017-11-01) In this paper, we address a new model of neural networks related to the impulsive phenomena which is called state-dependent impulsive recurrent neural networks with time-varying and continuously distributed delays. We investigate sufficient conditions on the existence and uniqueness of exponentially stable anti-periodic solution for these neural networks by employing method of coincide degree theory and an appropriate Lyapunov function. Moreover, we present an illustrative example to show the effectiveness ...
Dissimilarity maximization method for real-time routing of parts in random flexible manufacturing systems Saygin, C; Kilic, SE (Springer Science and Business Media LLC, 2004-04-01) This paper presents a dissimilarity maximization method (DMM) for real-time routing selection and compares it via simulation with typical priority rules commonly used in scheduling and control of flexible manufacturing systems (FMSs). DMM aims to reduce the congestion in the system by selecting a routing for each part among its alternative routings such that the overall dissimilarity among the selected routings is maximized. In order to evaluate the performance of DMM, a random FMS, where the product mix is...
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...

Citation Formats

E. TOPAN and Z. M. Avşar, “An approximation for kanban controlled assembly systems,” ANNALS OF OPERATIONS RESEARCH, pp. 133–162, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46233.