Algorithms and implementation of a set partitioning approach for modular machining line design

DOI10.1016/j.cor.2012.03.017zbMath1349.90275OpenAlexW2135138567MaRDI QIDQ339661

Alexandre Dolgui, Sergey Kovalev, Pavel Borisovsky

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.03.017

zbMATH Keywords

set partitioningline balancingparallel operationstransfer line design

Mathematics Subject Classification ID

Partitions of sets (05A18) Integer programming (90C10) Production models (90B30) Combinatorial optimization (90C27)

Related Items (2)

Procedures for the bin packing problem with precedence constraints ⋮ Minimizing the number of stations and station activation costs for a production line

Cites Work

• A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
• Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
• On solving the assembly line worker assignment and balancing problem via beam search
• A mathematical model and a genetic algorithm for two-sided assembly line balancing
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
• A general branch-and-bound algorithm for fair division problems
• Multiple-criteria decision-making in two-sided assembly line balancing: a goal programming and a fuzzy goal programming model
• 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
• The train driver recovery problem-a set partitioning based model and solution method
• Modelling transfer line design problem via a set partitioning problem
• Scheduling unrelated parallel machines with optional machines and jobs selection
• Optimisation of multi-position machines and transfer lines
• A special case of transfer lines balancing by graph approach
• Balancing assembly lines with tabu search
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms

This page was built for publication: Algorithms and implementation of a set partitioning approach for modular machining line design