A branch-and-bound algorithm for assembly line worker assignment and balancing problems
From MaRDI portal
(Redirected from Publication:2257352)
Recommendations
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- An linear programming based lower bound for the simple assembly line balancing problem
- Branch-and-bound algorithms for the multi-product assembly line balancing problem
Cites work
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- A classification of assembly line balancing problems
- A genetic algorithm for robotic assembly line balancing
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
- An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II
- Assignment Problems
- Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Introduction to algorithms.
- On solving the assembly line worker assignment and balancing problem via beam search
- Procedures for the time and space constrained assembly line balancing problem
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Variable neighborhood search
- Work assignment to and qualification of multi-skilled human resources under knowledge depreciation and company skill level targets
Cited in
(30)- Branch-and-bound algorithms for the multi-product assembly line balancing problem
- The multi-objective assembly line worker integration and balancing problem of type-2
- The robust (minmax regret) assembly line worker assignment and balancing problem
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem
- Optimal workforce assignment to operations of a paced assembly line
- Mixed model line balancing with parallel stations, zoning constraints, and ergonomics
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
- Exact and heuristic methods for solving the robotic assembly line balancing problem
- Developing optimization \& robust models for a mixed-model assembly line balancing problem with semi-automated operations
- Exact makespan minimization of unrelated parallel machines
- Branch, bound and remember algorithm for two-sided assembly line balancing problem
- Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach
- An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem
- Bottleneck easing-based assignment of work and product mixture determination: fuzzy assembly line balancing approach
- A branch and bound algorithm for dynamic resource allocation in population disease management
- Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
- Approximation Algorithms for the Assembly Line Crew Scheduling Problem
- Procedures for the bin packing problem with precedence constraints
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- Model and heuristics for the assembly line worker integration and balancing problem
- scientific article; zbMATH DE number 4059101 (Why is no real title available?)
- A Branch and Cut Approach for Workload Smoothing on Assembly Lines
- A systematic approach for an application of personnel selection in assembly line balancing problem
- Exact and heuristic methods for a workload allocation problem with chain precedence constraints
- Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm
- Model and metaheuristic for human-robot collaboration assembly line worker assignment and balancing problem
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
- A line balancing problem with parallel workers and cycle time minimization
- A novel dual-decomposition method for non-convex two-stage stochastic mixed-integer quadratically constrained quadratic problems
This page was built for publication: A branch-and-bound algorithm for assembly line worker assignment and balancing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2257352)
