Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads

DOI10.1016/j.ejor.2008.03.028zbMath1176.90654OpenAlexW2085114255MaRDI QIDQ1042027

I. Ihnatsenka, Alexandre Dolgui

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.03.028

zbMATH Keywords

integer programmingproductioncombinatorial optimizationfacilities planning and design

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (3)

A classification of assembly line balancing problems ⋮ Algorithms and implementation of a set partitioning approach for modular machining line design ⋮ Modelling transfer line design problem via a set partitioning problem

Cites Work

• Unnamed Item
• Assembly line balancing as generalized bin packing
• A special case of transfer lines balancing by graph approach
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Turan's Graph Theorem
• The Set-Partitioning Problem: Set Covering with Equality Constraints
• Optimum Network Partitioning
• Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems

This page was built for publication: Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads