A decomposition method for transfer line life cycle cost optimisation

DOI10.1007/S10852-005-9014-1zbMath1114.90029OpenAlexW1967443201MaRDI QIDQ853800

Nikolai Guschinsky, Genrikh Levin, Alexandre Dolgui

Publication date: 17 November 2006

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-005-9014-1

zbMATH Keywords

shortest pathbranch-and-boundline design and balancingmachining lines

Mathematics Subject Classification ID

Production models (90B30) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Vyacheslav Tanaev: contributions to scheduling and related areas

Cites Work

• An Integer Programming Procedure for Assembly System Design Problems
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• A comparison of heuristic algorithms for cost-oriented assembly line balancing

This page was built for publication: A decomposition method for transfer line life cycle cost optimisation