Combinatorial Benders cuts for assembly line balancing problems with setups

DOI10.1016/j.ejor.2016.11.001zbMath1394.90246OpenAlexW2341338378MaRDI QIDQ1751843

Sener Akpinar, Atabak Elmi, Tolga Bektaş

Publication date: 25 May 2018

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

Full work available at URL: https://eprints.soton.ac.uk/391260/1/Akpinar%2526Elmi%2526Bektas.pdf

zbMATH Keywords

combinatorial optimizationsequence-dependent setup timesBenders decompositioncombinatorial Benders cutstype-I assembly line balancing problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Combinatorial optimization (90C27)

Related Items (10)

Assembly line balancing: what happened in the last fifteen years? ⋮ Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints ⋮ Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition ⋮ The multi-period multi-trip container drayage problem with release and due dates ⋮ Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach ⋮ 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 ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions ⋮ Benders' decomposition for the balancing of assembly lines with stochastic demand

Uses Software

• SALBPGen
• 2-ANTBAL

Cites Work

• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
• Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
• A combinatorial Benders' decomposition for the lock scheduling problem
• A decomposition based solution algorithm for U-type assembly line balancing with interval data
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
• A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs
• The sequence-dependent assembly line balancing problem
• Sequencing mixed-model assembly lines: survey, classification and model critique
• Corrigendum to ``Balancing and scheduling tasks in assembly lines with sequence-dependent setup [European Journal of Operational Research 187 (2008) 1212-1223]
• Partitioning procedures for solving mixed-variables programming problems
• Reduction approaches for a generalized line balancing problem
• A survey on Benders decomposition applied to fixed-charge network design problems
• The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
• Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
• Assembly Line Planning and Control
• Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines with Sequence-Dependent Setup Times
• Combinatorial Benders' Cuts for the Strip Packing Problem
• Balancing two-sided assembly lines with sequence-dependent setup times
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations
• On extended formulations for the precedence constrained asymmetric traveling salesman problem
• Mixed Model Line Balancing with Smoothed Station Assignments

This page was built for publication: Combinatorial Benders cuts for assembly line balancing problems with setups