Branch and fathoming algorithms for operation sequencing in process planning

DOI10.1080/00207540010028100zbMath1025.90004OpenAlexW2100202209MaRDI QIDQ2758482

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

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

Related Items (4)

A multi-dimensional tabu search algorithm for the optimization of process planning ⋮ An efficient solution method to design the cost-minimizing platform portfolio ⋮ Iterative approach to operation selection and sequencing in process planning ⋮ Search heuristics for operation sequencing in process planning

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