A priority based assignment problem

DOI10.1016/J.APM.2016.03.038zbMath1471.90077OpenAlexW2316955812MaRDI QIDQ2293428

Vanita Verma, Prabhjot Kaur, Kalpana Dahiya, Anuj Kumar Sharma

Publication date: 5 February 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2016.03.038

zbMATH Keywords

optimizationcombinatorial analysisassignment problemallocationnon-linear programming

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Management decision making, including multiple objectives (90B50) Discrete location and assignment (90B80)

Related Items (9)

BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM ⋮ Task preference-based bottleneck assignment problem ⋮ An improved algorithm for two stage time minimization assignment problem ⋮ A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ Uncertain random assignment problem ⋮ A priority based unbalanced time minimization assignment problem ⋮ A priority based time minimization transportation problem ⋮ An iterative solution technique for capacitated two-stage time minimization transportation problem ⋮ An alternate approach to solve two-level priority based assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The generalized assignment problem with minimum quantities
• A dual approach for solving the combined distribution and assignment problem with link capacity constraints
• Alternate strategies for solving bottleneck assignment problems - analysis and computational results
• A strongly polynomial minimum cost circulation algorithm
• Algorithm for the solution of the bottleneck assignment problem
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• Lexicographic bottleneck problems
• On the bottleneck assignment problem
• An algorithm for the bottleneck generalized assignment problem
• Solution methods and computational investigations for the linear bottleneck assignment problem
• Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm
• On the complexity of project scheduling to minimize exposed time
• A goal programming approach for a multi-objective multi-choice assignment problem
• A min max problem
• A branch‐and‐price approach for the stochastic generalized assignment problem
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• A Combinatorial Algorithm

This page was built for publication: A priority based assignment problem