Branch and fathoming algorithms for operation sequencing in process planning

DOI10.1080/00207540010028100MaRDI QIDQ2758482zbMATH OpenOpenAlexFDO

Authors Dimitris Kiritsis, Paul Xirouchakis, Dong Ho Lee

Publication date 2 January 2002

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

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

zbMATH Keywords

heuristic branchfathoming algorithmsprecedence-directed graph

Mathematics Subject Classification ID

Production models (90B30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Iterative approach to operation selection and sequencing in process planning
• Search heuristics for operation sequencing in process planning
• Note—Operations Sequencing in Discrete Parts Manufacturing
• Optimal operation grouping and sequencing technique for multistage machining systems
• scientific article; zbMATH DE number 897942

Cited in

(7)

• An efficient solution method to design the cost-minimizing platform portfolio
• Graph theoretic algorithm for automatic operation sequencing for progressive die design
• Optimal operation grouping and sequencing technique for multistage machining systems
• A multi-dimensional tabu search algorithm for the optimization of process planning
• Feature-based operation sequence generation in CAPP
• Search heuristics for operation sequencing in process planning
• Iterative approach to operation selection and sequencing in process planning

This page was built for publication: Branch and fathoming algorithms for operation sequencing in process planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2758482)