The robust (minmax regret) assembly line worker assignment and balancing problem
type: Item
instance of: scholarly article
title: The robust (minmax regret) assembly line worker assignment and balancing problem
zbMATH Open document ID: 1391.90226
author: Jordi Pereira
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B70
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 6901566
zbMATH Keywords: production
zbMATH Keywords: line balancing
zbMATH Keywords: robust optimization
zbMATH Keywords: minmax regret
MaRDI profile type: Publication
full work available at URL: j.cor.2018.01.009
OpenAlex ID: W2782986007
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
cites work: Computing and minimizing the relative regret in combinatorial optimization with interval data
cites work: Interval data minmax regret network optimization problems
cites work: A survey on problems and methods in generalized assembly line balancing
cites work: Q3182207
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Robust discrete optimization and network flows
cites work: On solving the assembly line worker assignment and balancing problem via beam search
cites work: A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
cites work: A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
cites work: Scenario based robust line balancing: Computational complexity
cites work: The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
cites work: Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
cites work: A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem
cites work: Q4198056
cites work: Balancing of simple assembly lines under variations of task processing times
cites work: A decomposition based solution algorithm for U-type assembly line balancing with interval data
cites work: Discrete optimization with interval data. Minmax regret and fuzzy approach
cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems
cites work: Robust discrete optimization and its applications
cites work: A genetic algorithm for robotic assembly line balancing
cites work: Exact and approximation algorithms for makespan minimization on unrelated parallel machines
cites work: Minimising the maximum relative regret for linear programmes with interval objective function coefficients
cites work: Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
cites work: Model and heuristics for the assembly line worker integration and balancing problem
cites work: An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II
cites work: Procedures for the bin packing problem with precedence constraints
cites work: The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
cites work: Exact and heuristic algorithms for the interval data robust assignment problem
cites work: The robust set covering problem with interval data
cites work: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
cites work: SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
cites work: A branch, bound, and remember algorithm for the simple assembly line balancing problem
cites work: Stability analysis of an optimal balance for an assembly line with fixed cycle time
cites work: A branch-and-bound algorithm for assembly line worker assignment and balancing problems
DOI: 10.1016/J.COR.2018.01.009
description: scientific article; zbMATH DE number 6901566