BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM

DOI10.1017/S1446181122000116zbMath1501.90091MaRDI QIDQ5038210

Kalpana Dahiya, Ekta Jain, Vanita Verma

Publication date: 30 September 2022

Published in: The ANZIAM Journal (Search for Journal in Brave)

zbMATH Keywords

rankingassignmentbi-objectivescanningtime minimizationefficient pair

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey for the quadratic assignment problem
• The assignment problem under categorized jobs
• The quadratic assignment problem. Theory and algorithms
• Heuristics for biquadratic assignment problems and their computational comparison
• A note on a new variant of Murty's ranking assignments algorithm
• Nonlinear assignment problems. Algorithms and applications
• Bottleneck assignment problems under categorization
• A priority based assignment problem
• An improved algorithm for two stage time minimization assignment problem
• Two phase algorithms for the bi-objective assignment problem
• An algorithm for ranking assignments using reoptimization
• Linear Programming
• A min max problem
• Ranking assignments in order of increasing completion time
• Some Generalisations of the Time Minimising Assignment Problem
• The assignment problem with three job categories
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

This page was built for publication: BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM