Approximate design optimisation of asynchronous assembly systems
by C.M. Liu, L. Sanderst
International Journal of Computer Applications in Technology (IJCAT), Vol. 2, No. 1, 1989

Abstract: This paper presents a method for the approximate design optimisation of closed asynchronous assembly systems which are widely used in manufacturing. The design parameters under consideration are the number of workpieces (pallets) to be loaded on the system and the number of buffer units that are to be installed between each adjacent pair of stations. This problem is especially difficult due to the stochastic nature of the system and the discrete decision variables. The optimisation problem can be solved by Monte Carlo optimisation by running an optimising program together with a discrete event simulation of the physical system. Unfortunately this approach often requires several hours of computer time for each set of parameters to be evaluated. This makes it infeasible for engineering design because the designer usually needs to try many alternative configurations. The method presented in this paper allows the engineer to obtain results of the Monte Carlo optimisation (approximately) with only a few numerical calculations. If a final configuration is selected then simulation can be used to verify or 'fine tune' the approximate results.

Online publication date: Wed, 11-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email