An optimal running policy for buffered continuous production processes subject to random breakdown

Cheng, Russell C.H. (1995) An optimal running policy for buffered continuous production processes subject to random breakdown. In: UK-Japanese Workshop on Stochastic Modelling in Innovative Manufacturing, July 20-21, 1995, Cambridge, England. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)

Abstract

We present a general stochastic production model that is useful for examining the behaviour of complex systems. The model is made up of a linked system of production processes (units) together with buffer storages between the units. The productive capacity of the units are subject to random breakdown and periodic maintenance. Branching and recycling of intermediate products and materials, as well as inter-dependence of operation between units, are allowed. It is not always clear how best to operate such a system or to check that a given operating policy is well-defined. The model is rigorously developed and analysed using the theory of maximal solutions of differential inequalities with discontinuous right-hand sides. It is shown that when the capacities of the units possess a certain quasi-monotone increasing property, then there exists a well-defined, greedy 'full-on' operating policy. Moreover the policy maximizes throughput globally so that it is thus never optimal to try to balance the output of units to try to smooth production or to 'save for a rainy day'. Several examples are given showing the flexibility of the model.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: differential equations with discontinuous right hand sides; maximal solutions
Depositing User: T. Nasir
Date Deposited: 27 Oct 2009 18:36
Last Modified: 10 Jun 2014 08:51
Resource URI: http://kar.kent.ac.uk/id/eprint/18343 (The current URI for this page, for reference purposes)
  • Depositors only (login required):