Maximum diversity/similarity models with extension to part grouping

DOI10.1111/j.1475-3995.2005.497_1.xzbMath1131.90333MaRDI QIDQ3025047

Jay B. Ghosh, Gajendra Kumar Adil

Publication date: 4 July 2005

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2005.497_1.x

zbMATH Keywords

heuristics; mathematical programming; group technology; group formation

Mathematics Subject Classification ID

90B30: Production models

Related Items

Construction and improvement algorithms for dispersion problems, The equitable dispersion problem, Solving the maximum min-sum dispersion by alternating formulations of two different problems, Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS

Cites Work

• Unnamed Item
• Unnamed Item
• The discrete p-dispersion problem
• Analytical models for locating undesirable facilities
• Computational aspects of the maximum diversity problem
• The discrete p-maxian location problem
• A discrete optimization model for preserving biological diversity
• Heuristic algorithms for the maximum diversity problem
• Empirical findings on manufacturing cell design
• A similarity coefficient measure and machine-parts grouping in cellular manufacturing systems
• Lagrangian solution of maximum dispersion problems
• Measures of grouping efficiency in cellular manufacturing systems