A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)

DOI10.1016/j.ejor.2016.10.008zbMath1394.90248OpenAlexW2529407609MaRDI QIDQ1751784

Krzysztof Fleszar

Publication date: 25 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.10.008

zbMATH Keywords

assembly line balancingMILPaccessibility windowscycle time minimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (2)

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

Cites Work

• Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
• Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
• Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1)
• Moving policies in cyclic assembly line scheduling
• A classification of assembly line balancing problems
• Workload Balancing in Multi-stage Production Processes

This page was built for publication: A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)