Graph theoretic algorithm for automatic operation sequencing for progressive die design

DOI10.1080/00207540500521295zbMath1141.90390OpenAlexW2087403654MaRDI QIDQ3498881

No author found.

Publication date: 19 May 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540500521295

zbMATH Keywords

precedence graphadjacency graphstamping operation sequencingstrip layout design

Mathematics Subject Classification ID

Production models (90B30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Uses Software

• SolidWorks

Cites Work

• Unnamed Item
• Linear coloring of graphs
• Practical methods of computer-aided flat pattern development for sheet metal components
• Almost all k-colorable graphs are easy to color
• New methods to color the vertices of a graph
• Unfolding sheet metal parts: a graph-based approach
• HPRODIE: Using feature modelling and feature mapping to speed up progressive die design
• Methods for the sequencing of sheet metal bending operations
• An algorithm for the chromatic number of a graph
• The smallest hard-to-color graph for algorithm DSATUR

This page was built for publication: Graph theoretic algorithm for automatic operation sequencing for progressive die design