Pass schedule design for flat-tool forging based on upper bound analysis
by W. Chen, Z. Cui
International Journal of Materials and Product Technology (IJMPT), Vol. 40, No. 3/4, 2011

Abstract: A pass schedule algorithm, which uses an improved upper bound method for metal flow analysis is proposed for multi-pass flat-tool forging. In the upper bound analysis, a set of kinematically admissible velocity fields is firstly constructed. The effects of billet-die frictions and rigid end constraints on metal flow are both taken into account. By using the calculated approximate velocity fields, changes in the billet dimensions in each forging pass are predicted. In order to verify effectiveness of the analysis, the predicted spread coefficients under different process conditions are compared with the cited experimental results. Based on the upper bound analysis, pass schedules are developed by iterative searches under the requirement of billet target dimensions. As an example, the proposed algorithm is applied to an alloy block forging process. The designed pass schedules are then selected and simulated by finite element method to get an optimal one. It is shown that the overall process design of multi-pass flat-tool forging could be achieved by the proposed algorithm and the subsequent finite element simulations.

Online publication date: Sat, 28-Feb-2015

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 Materials and Product Technology (IJMPT):
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 subs@inderscience.com