Constrained group balancing: why does it work

DOI10.1016/j.ejor.2010.02.011zbMath1188.90286OpenAlexW2049343437MaRDI QIDQ976414

Anton Ovchinnikov, Dmitry Krass

Publication date: 11 June 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.011

zbMATH Keywords

combinatorial optimizationeducationdecision supportOR applicationsgroup balancing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (7)

Iterated maxima search for the maximally diverse grouping problem ⋮ A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem ⋮ The balanced maximally diverse grouping problem with attribute values ⋮ Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping ⋮ The balanced maximally diverse grouping problem with block constraints ⋮ A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values ⋮ Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search

Cites Work

• Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging
• Design of balanced MBA student teams
• Unnamed Item

This page was built for publication: Constrained group balancing: why does it work