Improved integer programming models for simple assembly line balancing and related problems
From MaRDI portal
Publication:5374525
DOI10.1111/ITOR.12206zbMath1395.90188arXiv1111.0934OpenAlexW2963734638MaRDI QIDQ5374525
Publication date: 14 September 2018
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.0934
integer linear programmingvalid inequalitiesprecedence constraintsassembly line balancingstation limits
Related Items (7)
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 ⋮ Analysis of the simple assembly line balancing problem complexity ⋮ In-line kitting for part feeding of assembly lines: workload balancing and storage assignment to reduce the workers' walking effort ⋮ Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in seru production systems ⋮ A multi‐objective hybrid evolutionary search algorithm for parallel production line balancing problem including disassembly and assembly tasks ⋮ Benders' decomposition for the balancing of assembly lines with stochastic demand
This page was built for publication: Improved integer programming models for simple assembly line balancing and related problems