Optimum process plan selection via branch-and-bound algorithm in an automated manufacturing environment
DOI10.1504/IJOR.2012.045665zbMATH Open1362.90176OpenAlexW2002078119MaRDI QIDQ2627262
Hossein Sattari, Amir Musa Abazari, Maghsud Solimanpur
Publication date: 31 May 2017
Published in: International Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijor.2012.045665
branch-and-bound algorithmdecision makingautomated manufacturingCAPP: mathematical programmingcomputer-aided process planningprocess plan selection
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Combinatorial optimization (90C27)
Related Items (1)
This page was built for publication: Optimum process plan selection via branch-and-bound algorithm in an automated manufacturing environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2627262)