The robust (minmax regret) assembly line worker assignment and balancing problem
From MaRDI portal
Publication:1652575
DOI10.1016/j.cor.2018.01.009zbMath1391.90226OpenAlexW2782986007MaRDI QIDQ1652575
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.01.009
Integer programming (90C10) Minimax problems in mathematical programming (90C47) Production models (90B30) Discrete location and assignment (90B80) Theory of organizations, manpower planning in operations research (90B70)
Related Items (8)
Assembly line balancing: what happened in the last fifteen years? ⋮ An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion ⋮ Branch, bound and remember algorithm for two-sided assembly line balancing problem ⋮ Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem ⋮ 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 ⋮ Exact and heuristic methods for a workload allocation problem with chain precedence constraints ⋮ Robust optimization for U-shaped assembly line worker assignment and balancing problem with uncertain task times
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- A decomposition based solution algorithm for U-type assembly line balancing with interval data
- An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II
- 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
- Scenario based robust line balancing: Computational complexity
- Exact and heuristic algorithms for the interval data robust assignment problem
- On solving the assembly line worker assignment and balancing problem via beam search
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Partitioning procedures for solving mixed-variables programming problems
- Robust discrete optimization and its applications
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Robust discrete optimization and network flows
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- Interval data minmax regret network optimization problems
- Balancing of simple assembly lines under variations of task processing times
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
- Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
- 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
- Stability analysis of an optimal balance for an assembly line with fixed cycle time
- A genetic algorithm for robotic assembly line balancing
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem
- Minimising the maximum relative regret for linear programmes with interval objective function coefficients
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
This page was built for publication: The robust (minmax regret) assembly line worker assignment and balancing problem
