System performance analysis of flexible flow shop with match processing constraint

Abstract

Blocking makes the analytical modelling of open queuing networks with finite buffers intractable because the product-form solutions are unavailable. In this paper, about mould manufacturing, a four-stage flexible flow shop with match processing constraint is first modelled as an open queuing network with finite buffers. According to the characteristics of the matching node, the inter-arrival time distributions of parts arriving at the nodes are assumed to be exponential or general. Next, based on approximation of queuing theory, the Decomposition of State Space Method and the Generalized Expansion Method are developed for system performance evaluation. Then, experiments to assess the accuracy of the proposed methods are reported by comparing the analytical results with simulations. Finally, a case of a real-life production system of mould manufacturing is studied to show the application of the proposed methods. The results of experiments reveal that the proposed methods are feasible and effective for system performance evaluation and they can even solve large-size practical problems in a reasonable time. The results in this paper can provide a basis for system design or resource planning, to solve buffer allocation problems and capacity configuration problems.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 11 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.