Time-cost trade-off analysis of a priority based assignment problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s12597-020-00483-4
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Pinker, Edieal & Szmerekovsky, Joseph & Tilson, Vera, 2014. "On the complexity of project scheduling to minimize exposed time," European Journal of Operational Research, Elsevier, vol. 237(2), pages 448-453.
- Özlem Karsu & Meral Azizoğlu, 2014. "Bicriteria multiresource generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(8), pages 621-636, December.
- Ming S. Hung & Walter O. Rom, 1980. "Solving the Assignment Problem by Relaxation," Operations Research, INFORMS, vol. 28(4), pages 969-982, August.
- Robert S. Garfinkel, 1971. "Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem," Operations Research, INFORMS, vol. 19(7), pages 1747-1751, December.
- Christian Roed Pedersen & Lars Relund Nielsen & Kim Allan Andersen, 2008. "The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 400-411, August.
- Krumke, Sven O. & Thielen, Clemens, 2013. "The generalized assignment problem with minimum quantities," European Journal of Operational Research, Elsevier, vol. 228(1), pages 46-55.
- Leon F. McGinnis, 1983. "Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem," Operations Research, INFORMS, vol. 31(2), pages 277-291, April.
- Subhash C. Sarin & Hanif D. Sherali & Seon Ki Kim, 2014. "A branch‐and‐price approach for the stochastic generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(2), pages 131-143, March.
- Richard S. Hatch, 1975. "Technical Note—Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms," Operations Research, INFORMS, vol. 23(6), pages 1167-1172, December.
- H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
- Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
- Seungkyu Ryu & Anthony Chen & Xiangdong Xu & Keechoo Choi, 2014. "A Dual Approach for Solving the Combined Distribution and Assignment Problem with Link Capacity Constraints," Networks and Spatial Economics, Springer, vol. 14(2), pages 245-270, June.
- Geetha, S. & Nair, K. P. K., 1993. "A variation of the assignment problem," European Journal of Operational Research, Elsevier, vol. 68(3), pages 422-426, August.
- Huizhen Zhang & Cesar Beltran-Royo & Liang Ma, 2013. "Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers," Annals of Operations Research, Springer, vol. 207(1), pages 261-278, August.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Fanrong Xie & Anuj Sharma & Zuoan Li, 2022. "An alternate approach to solve two-level priority based assignment problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 613-656, March.
- Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
- Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
- Arora, Shalini & Puri, M. C., 1998. "A variant of time minimizing assignment problem," European Journal of Operational Research, Elsevier, vol. 110(2), pages 314-325, October.
- Talmor, Irit, 2022. "Solving the problem of maximizing diversity in public sector teams," Socio-Economic Planning Sciences, Elsevier, vol. 81(C).
- Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
- P. Senthil Kumar, 2020. "Developing a New Approach to Solve Solid Assignment Problems Under Intuitionistic Fuzzy Environment," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 9(1), pages 1-34, January.
- Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.
- Ekta Jain & Kalpana Dahiya & Vanita Verma, 2020. "A priority based unbalanced time minimization assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 13-45, March.
- Jingqun Li & R. Tharmarasa & Daly Brown & Thia Kirubarajan & Krishna R. Pattipati, 2019. "A novel convex dual approach to three-dimensional assignment problem: theoretical analysis," Computational Optimization and Applications, Springer, vol. 74(2), pages 481-516, November.
- Ekta Jain & Kalpana Dahiya & Anuj Sharma & Vanita Verma, 2019. "An improved algorithm for two stage time minimization assignment problem," Journal of Combinatorial Optimization, Springer, vol. 37(2), pages 713-736, February.
- Monnerat, Filipe & Dias, Joana & Alves, Maria João, 2019. "Fleet management: A vehicle and driver assignment model," European Journal of Operational Research, Elsevier, vol. 278(1), pages 64-75.
- Boštjan Gabrovšek & Tina Novak & Janez Povh & Darja Rupnik Poklukar & Janez Žerovnik, 2020. "Multiple Hungarian Method for k -Assignment Problem," Mathematics, MDPI, vol. 8(11), pages 1-18, November.
- Guojun Hu & Junran Lichen & Pengxiang Pan, 2023. "Two Combinatorial Algorithms for the Constrained Assignment Problem with Bounds and Penalties," Mathematics, MDPI, vol. 11(24), pages 1-12, December.
- Ivan Belik & Kurt Jornsten, 2018. "Critical objective function values in linear sum assignment problems," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 842-852, April.
- Sana Bouajaja & Najoua Dridi, 2017. "A survey on human resource allocation problem and its applications," Operational Research, Springer, vol. 17(2), pages 339-369, July.
- Andreas Kleine & Andreas Dellnitz, 2017. "Allocation of seminar applicants," Journal of Business Economics, Springer, vol. 87(7), pages 927-941, October.
- Jingqun Li & Thia Kirubarajan & R. Tharmarasa & Daly Brown & Krishna R. Pattipati, 2021. "A dual approach to multi-dimensional assignment problems," Journal of Global Optimization, Springer, vol. 81(3), pages 691-716, November.
- Weiqiang Shen & Chuanlin Zhang & Xiaona Zhang & Jinglun Shi, 2019. "A fully distributed deployment algorithm for underwater strong k-barrier coverage using mobile sensors," International Journal of Distributed Sensor Networks, , vol. 15(4), pages 15501477198, April.
- Bo Cowgill & Jonathan M. V. Davis & B. Pablo Montagnes & Patryk Perkowski, 2024.
"Stable Matching on the Job? Theory and Evidence on Internal Talent Markets,"
CESifo Working Paper Series
11120, CESifo.
- Cowgill, Bo & Davis, Jonathan & Montagnes, B. Pablo & Perkowski, Patryk, 2024. "Stable Matching on the Job? Theory and Evidence on Internal Talent Markets," IZA Discussion Papers 16986, Institute of Labor Economics (IZA).
More about this item
Keywords
Optimization; Non-linear programming; Assignment problem; Bi-objective; Efficient solutions;All these keywords.
JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:opsear:v:58:y:2021:i:2:d:10.1007_s12597-020-00483-4. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.