A priority based unbalanced time minimization assignment problem
From MaRDI portal
Publication:2307977
DOI10.1007/s12597-019-00399-8OpenAlexW2965248645WikidataQ127396439 ScholiaQ127396439MaRDI QIDQ2307977
Vanita Verma, Kalpana Dahiya, Ekta Jain
Publication date: 25 March 2020
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-019-00399-8
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some special cases of assignment problems
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results
- An efficient approximation for the generalized assignment problem
- The assignment problem under categorized jobs
- Algorithm for the solution of the bottleneck assignment problem
- On the quadratic assignment problem
- Lexicographic bottleneck problems
- On the bottleneck assignment problem
- A variant of time minimizing assignment problem
- Solution methods and computational investigations for the linear bottleneck assignment problem
- Bottleneck assignment problems under categorization
- A new greedy algorithm for the quadratic assignment problem
- A priority based assignment problem
- A modified method for solving the unbalanced assignment problems
- The Quadratic Assignment Problem
- Algorithms for the Assignment and Transportation Problems
- Tight approximation algorithms for maximum general assignment problems
- Some Generalisations of the Time Minimising Assignment Problem
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- P-Complete Approximation Problems
- The assignment problem with three job categories
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
This page was built for publication: A priority based unbalanced time minimization assignment problem
