Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method

DOI10.1007/s10479-016-2156-xzbMath1369.90107OpenAlexW2301095761MaRDI QIDQ2399325

Talip Kellegöz

Publication date: 22 August 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2156-x

zbMATH Keywords

integer programmingsimulated annealingline balancingmulti-manned stationsGantt based representation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

An exact solution method for multi-manned disassembly line design with and/or precedence relations, Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints, Constraint programming model for multi-manned assembly line balancing problem, Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in seru production systems, Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers, A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem, Type-E disassembly line balancing problem with multi-manned workstations

Cites Work

• Optimization by Simulated Annealing
• An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
• Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
• Optimally solving the alternative subgraphs assembly line balancing problem
• Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm
• An information guided framework for simulated annealing
• Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• Tabu Search—Part I
• Tabu Search—Part II
• ULINO: Optimally balancing U-shaped JIT assembly lines
• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing