The robust (minmax regret) assembly line worker assignment and balancing problem

Minimax problems in mathematical programming (90C47) Integer programming (90C10) Production models (90B30) Theory of organizations, manpower planning in operations research (90B70) Discrete location and assignment (90B80)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Partitioning procedures for solving mixed-variables programming problems
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
A genetic algorithm for robotic assembly line balancing
SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
Robust discrete optimization and its applications
Robust discrete optimization and network flows
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Interval data minmax regret network optimization problems
Balancing of simple assembly lines under variations of task processing times
Stability analysis of an optimal balance for an assembly line with fixed cycle time
A branch, bound, and remember algorithm for the simple assembly line balancing problem
Scenario based robust line balancing: Computational complexity
An approximation algorithm for interval data minmax regret combinatorial optimization problems
A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem
A decomposition based solution algorithm for U-type assembly line balancing with interval data
A branch-and-bound algorithm for assembly line worker assignment and balancing problems
Procedures for the bin packing problem with precedence constraints
Exact and approximation algorithms for makespan minimization on unrelated parallel machines
Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
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
An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II
The robust set covering problem with interval data
Exact and heuristic algorithms for the interval data robust assignment problem
On solving the assembly line worker assignment and balancing problem via beam search
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
Discrete optimization with interval data. Minmax regret and fuzzy approach
Minimising the maximum relative regret for linear programmes with interval objective function coefficients
Computing and minimizing the relative regret in combinatorial optimization with interval data
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
The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem

Cited In (10)

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
Assembly line balancing: what happened in the last fifteen years?
Robust optimization for U-shaped assembly line worker assignment and balancing problem with uncertain task times
Robust counterpart mathematical models for balancing, sequencing, and assignment of robotic U-shaped assembly lines with considering failures and setup times
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
An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
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

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)