Published in

SAGE Publications, Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 4(218), p. 467-471, 2004

DOI: 10.1243/095440504323055597

Links

Tools

Export citation

Search in Google Scholar

A graph theoretic approach for stamping operations sequencing

Journal article published in 2004 by C. Y. Chu, S. B. Tor ORCID, G. A. Britton
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

This paper presents initial work to develop a novel, mathematical technique that is capable of generating a stamping sequence automatically in the design of progressive stamping dies. A graph is used to represent a stamping part and define the relationships between its stamping features. These stamping features are then clustered into workstation sets using a graph colouring algorithm. Next, the sets are ordered in order to determine an optimal sequence of workstations. The objective function for optimization is ‘minimization of the torque difference between two sides of the progressive die’.