Modelling transfer line design problem via a set partitioning problem
From MaRDI portal
Publication:1758032
DOI10.1007/s11590-011-0317-zzbMath1254.90187OpenAlexW2089323951MaRDI QIDQ1758032
Sergey Kovalev, Pavel Borisovsky, Alexandre Dolgui
Publication date: 7 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0317-z
Related Items (1)
Cites Work
- Unnamed Item
- A hybrid metaheuristic approach to solving the UBQP problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A dual ascent procedure for the set partitioning problem
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Multiple-criteria decision-making in two-sided assembly line balancing: a goal programming and a fuzzy goal programming model
- Complementary column generation and bounding approaches for set partitioning formulations
- Balancing modular transfer lines with serial-parallel activation of spindle heads at stations
- Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads
- On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning
- Balancing assembly lines effectively -- a computational comparison
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- Optimisation of multi-position machines and transfer lines
- Constraint handling in genetic algorithms: the set partitioning problem
- A special case of transfer lines balancing by graph approach
- Balancing assembly lines with tabu search
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems
- Configuration des lignes d'usinage à boîtiers multibroches : une approche mixte
- Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems
- An Integer Programming Procedure for Assembly System Design Problems
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Set Partitioning: A survey
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
This page was built for publication: Modelling transfer line design problem via a set partitioning problem
