Abstract

Kanban systems provide a way to implement a pull-type control policy. In this paper, we propose an analytical method for approximating the performance of a multiple-product kanban production system. This method uses the queueing network model of the kanban system, which is a closed multiclass queueing network (each class represents one type of kanban). It is based on the product-form approximation technique and is an extension of a previous method which had been programmed for mono-product kanban production systems with general topology. For multiple-product production systems, we can have several different types of products on a machine (we have restricted our study to only two types). So, we have a new problem: we must define the processing order of products. We can distinguish two cases according to set-up times. If set-up times are not null, we must try to limit the number of set-ups. But, if set-up times are null, we can choose the processing order without worrying about the limitation of set-ups number. We have realized the analysis for this second case in characterizing service time distributions with two moments. Finally, to test the method, we have compared analytical results to simulation results.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.