An exact constraint programming based procedure for the multi-manned assembly line balancing problem
From MaRDI portal
Publication:6551052
DOI10.1016/J.COR.2023.106451MaRDI QIDQ6551052
Moacyr Carlos Possan Junior, Adalberto Sato Michels, Leandro Magatão
Publication date: 6 June 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
boundsconstraint programming (CP)mixed-Integer linear programming (MILP)multi-manned assembly line balancing problem (MALBP)
Cites Work
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- Model and heuristics for the assembly line worker integration and balancing problem
- An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
- Explaining the \texttt{cumulative} propagator
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
- Redundant cumulative constraints to compute preemptive bounds
- Mixed model line balancing with parallel stations, zoning constraints, and ergonomics
- Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- Assembly line balancing: what happened in the last fifteen years?
- Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints
- A classification of assembly line balancing problems
- Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method
- 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
- A survey on problems and methods in generalized assembly line balancing
- Constraint programming model for multi-manned assembly line balancing problem
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- Constraint and Integer Programming in OPL
- Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources
- An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
- Principles of Constraint Programming
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions
- Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers
This page was built for publication: An exact constraint programming based procedure for the multi-manned assembly line balancing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551052)