Balancing modular transfer lines with serial-parallel activation of spindle heads at stations

DOI10.1016/j.dam.2008.04.020zbMath1155.90364OpenAlexW1976986844MaRDI QIDQ1003756

I. Ihnatsenka, Alexandre Dolgui

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.04.020

zbMATH Keywords

branch and boundlower boundset partitioningline balancingmachining transfer lines

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Combinatorial optimization (90C27)

Related Items (3)

Algorithms and implementation of a set partitioning approach for modular machining line design ⋮ Scenario based robust line balancing: Computational complexity ⋮ Modelling transfer line design problem via a set partitioning problem

Cites Work

• Optimisation of multi-position machines and transfer lines
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• 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
• An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
• Optimum Network Partitioning
• Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems

This page was built for publication: Balancing modular transfer lines with serial-parallel activation of spindle heads at stations