The robust (minmax regret) assembly line worker assignment and balancing problem
From MaRDI portal
Publication:1652575
Recommendations
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- Balancing of simple assembly lines under variations of task processing times
- Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
- On solving the assembly line worker assignment and balancing problem via beam search
- The multi-objective assembly line worker integration and balancing problem of type-2
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
- A decomposition based solution algorithm for U-type assembly line balancing with interval data
- 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 linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem
- A survey on problems and methods in generalized assembly line balancing
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II
- Balancing of simple assembly lines under variations of task processing times
- Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Exact and heuristic algorithms for the interval data robust assignment problem
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Interval data minmax regret network optimization problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minimising the maximum relative regret for linear programmes with interval objective function coefficients
- Model and heuristics for the assembly line worker integration and balancing problem
- On solving the assembly line worker assignment and balancing problem via beam search
- Partitioning procedures for solving mixed-variables programming problems
- Procedures for the bin packing problem with precedence constraints
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust optimization
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- Scenario based robust line balancing: Computational complexity
- Stability analysis of an optimal balance for an assembly line with fixed cycle time
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- The robust set covering problem with interval data
Cited in
(12)- Branch, bound and remember algorithm for two-sided assembly line balancing problem
- Assembly line balancing: what happened in the last fifteen years?
- Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
- Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- 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
- Robust optimization for U-shaped assembly line worker assignment and balancing problem with uncertain task times
- The multi-objective assembly line worker integration and balancing problem of type-2
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
- Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach
- Robust counterpart mathematical models for balancing, sequencing, and assignment of robotic U-shaped assembly lines with considering failures and setup times
This page was built for publication: The robust (minmax regret) assembly line worker assignment and balancing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652575)
