{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:27Z","timestamp":1740142467836,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T00:00:00Z","timestamp":1662076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T00:00:00Z","timestamp":1662076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001412","name":"council of scientific and industrial research, india","doi-asserted-by":"publisher","award":["09\/135\/(0724)\/2015-EMR-I"],"award-info":[{"award-number":["09\/135\/(0724)\/2015-EMR-I"]}],"id":[{"id":"10.13039\/501100001412","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001843","name":"science and engineering research board","doi-asserted-by":"publisher","award":["MTR\/2019\/000723"],"award-info":[{"award-number":["MTR\/2019\/000723"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s40314-022-01999-9","type":"journal-article","created":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T00:42:57Z","timestamp":1662165777000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Task preference-based bottleneck assignment problem"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6099-6848","authenticated-orcid":false,"given":"Ekta","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4571-7254","authenticated-orcid":false,"given":"Kalpana","family":"Dahiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2219-2528","authenticated-orcid":false,"given":"Anuj","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vanita","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,2]]},"reference":[{"issue":"1\u20132","key":"1999_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.mcm.2009.09.004","volume":"51","author":"AO Adewumi","year":"2010","unstructured":"Adewumi AO, Ali MM (2010) A multi-level genetic algorithm for a multi-stage space allocation problem. Math Comput Model 51(1\u20132):109\u201326","journal-title":"Math Comput Model"},{"key":"1999_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0377-2217(83)90312-0","volume":"14","author":"V Aggarwal","year":"1983","unstructured":"Aggarwal V (1983) The assignment problem under categorized jobs. Eur J Oper Res 14:193\u2013195","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1999_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0305-0548(86)90060-2","volume":"13","author":"V Aggarwal","year":"1986","unstructured":"Aggarwal V, Tikekar VG, Hsu LF (1986) Bottleneck assignment problems under categorization. Comput Oper Res 13(1):11\u201326","journal-title":"Comput Oper Res"},{"key":"1999_CR4","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.mathsocsci.2014.04.007","volume":"71","author":"FM Biermann","year":"2014","unstructured":"Biermann FM, Naroditskiy V, Polukarov M, Nguyen TD, Rogers A, Jennings NR (2014) Task assignment with controlled and autonomous agents. Math Soc Sci 71:116\u2013121","journal-title":"Math Soc Sci"},{"key":"1999_CR5","doi-asserted-by":"crossref","unstructured":"Burkard R, Dell\u2019Amico M, Martello S (2012) Assignment problems: revised reprint. Soc Ind Appl Math","DOI":"10.1137\/1.9781611972238"},{"key":"1999_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF02243552","volume":"27","author":"G Carpenato","year":"1981","unstructured":"Carpenato G, Toth P (1981) Algorithm for the solution of the bottleneck assignment problem. Computing 27:179\u2013187","journal-title":"Computing"},{"key":"1999_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02252026","volume":"19","author":"U Derigs","year":"1978","unstructured":"Derigs U, Zimmermann U (1978) An Augmenting path method for solving linear bottleneck assignment problems. Computing 19:285\u2013295","journal-title":"Computing"},{"issue":"4","key":"1999_CR8","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.orl.2012.04.003","volume":"40","author":"T Dokka","year":"2012","unstructured":"Dokka T, Kouvela A, Spieksma FC (2012) Approximating the multi-level bottleneck assignment problem. Oper Res Lett 40(4):282\u2013286","journal-title":"Oper Res Lett"},{"key":"1999_CR9","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/8958393","author":"S Faudzi","year":"2018","unstructured":"Faudzi S, Abdul-Rahman S, Rahman RA (2018) An assignment problem and its application in education domain: a review and potential path. Adv Oper Res. https:\/\/doi.org\/10.1155\/2018\/8958393","journal-title":"Adv Oper Res"},{"key":"1999_CR10","doi-asserted-by":"publisher","first-page":"1747","DOI":"10.1287\/opre.19.7.1747","volume":"19","author":"RS Garfinkel","year":"1971","unstructured":"Garfinkel RS (1971) An improved algorithm for the bottleneck assignment problem. Oper Res 19:1747\u20131751","journal-title":"Oper Res"},{"key":"1999_CR11","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1007\/s10878-016-0011-2","volume":"33","author":"J Hu","year":"2017","unstructured":"Hu J, Jiang Y, Zhou P, Zhang A, Zhang Q (2017) Total completion time minimization in online hierarchical scheduling of unit-size jobs. J Comb Optim 33:866\u2013881","journal-title":"J Comb Optim"},{"key":"1999_CR12","first-page":"71","volume":"63","author":"P Ioannis","year":"2020","unstructured":"Ioannis P, Dimitrios GP (2020) Optimal server assignment in a two-stage tandem queueing system. Oper Res Lett 63:71\u201377","journal-title":"Oper Res Lett"},{"key":"1999_CR13","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s10878-018-0318-2","volume":"37","author":"E Jain","year":"2019","unstructured":"Jain E, Dahiya K, Sharma A, Verma V (2019) An improved algorithm for two stage time minimization assignment problem. J Comb Optim 37:713\u2013736","journal-title":"J Comb Optim"},{"issue":"3","key":"1999_CR14","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1080\/0305215X.2020.1739279","volume":"53","author":"E Jain","year":"2021","unstructured":"Jain E, Dahiya K, Verma V (2021) Three-phase time minimization transportation problem. Eng Optim 53(3):461\u2013473","journal-title":"Eng Optim"},{"issue":"1","key":"1999_CR15","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1080\/10556788.2012.728216","volume":"29","author":"S Karademir","year":"2014","unstructured":"Karademir S, Kong N, Prokopvev OA (2014) On greedy approximation algorithms for a class of two-stage stochastic assignment problems. Optim Methods Softw 29(1):42\u201367","journal-title":"Optim Methods Softw"},{"issue":"7","key":"1999_CR16","doi-asserted-by":"publisher","first-page":"7784","DOI":"10.1016\/j.apm.2016.03.038","volume":"40","author":"P Kaur","year":"2016","unstructured":"Kaur P, Sharma A, Verma V, Dahiya K (2016) A priority based assignment problem. Appl Math Model 40(7):7784\u20137795","journal-title":"Appl Math Model"},{"issue":"2","key":"1999_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"55","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian method for the assignment problem. Nav Res Logist 55(2):83\u201397","journal-title":"Nav Res Logist"},{"issue":"1","key":"1999_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0165-4896(02)00003-3","volume":"44","author":"S Lahiri","year":"2002","unstructured":"Lahiri S (2002) Robust multivalued solutions for assignment problems: a note. Math Soc Sci 44(1):85\u201390","journal-title":"Math Soc Sci"},{"key":"1999_CR19","doi-asserted-by":"publisher","unstructured":"Li J, Chen J, Xin B, Dou L (2015) Solving multi-objective multi-stage weapon target assignment problem via adaptive NSGA-II and adaptive MOEA\/D: A comparison study . IEEE Congress on Evolutionary Computation (CEC): 3132\u20133139, https:\/\/doi.org\/10.1109\/CEC.2015.7257280","DOI":"10.1109\/CEC.2015.7257280"},{"key":"1999_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.mathsocsci.2019.11.003","volume":"103","author":"J Ortega","year":"2020","unstructured":"Ortega J (2020) Multi-unit assignment under dichotomous preferences. Math Soc Sci 103:15\u201324","journal-title":"Math Soc Sci"},{"issue":"2","key":"1999_CR21","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.ejor.2005.09.014","volume":"176","author":"DW Pentico","year":"2007","unstructured":"Pentico DW (2007) Assignment problems: A golden anniversary survey. Eur J Oper Res 176(2):774\u2013793","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1999_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF02684443","volume":"59","author":"U Pferschy","year":"1997","unstructured":"Pferschy U (1997) Solution methods and computational investigations for the linear bottleneck assignment problem. Computing 59(3):237\u2013258","journal-title":"Computing"},{"key":"1999_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00181-8","author":"AP Punnen","year":"2004","unstructured":"Punnen AP (2004) On bottleneck assignment problems under categorization. Comput Oper Res. https:\/\/doi.org\/10.1016\/S0305-0548(02)00181-8","journal-title":"Comput Oper Res"},{"issue":"7","key":"1999_CR24","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1057\/jors.1993.116","volume":"44","author":"AP Punnen","year":"1993","unstructured":"Punnen AP, Aneja YP (1993) Categorized assignment scheduling: a tabu search approach. J Oper Res Soc 44(7):673\u2013679","journal-title":"J Oper Res Soc"},{"issue":"1","key":"1999_CR25","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0167-6377(03)00065-8","volume":"32","author":"AP Punnen","year":"2004","unstructured":"Punnen AP, Aneja YP (2004) Lexicographic balanced optimization problems. Oper Res Lett 32(1):27\u201330","journal-title":"Oper Res Lett"},{"key":"1999_CR26","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1051\/ro\/2016051","volume":"50","author":"K Rathi","year":"2016","unstructured":"Rathi K, Balamohan S (2016) Two stage decision making appproach for sensor mission. RAIRO-Oper Res 50:797\u2013807","journal-title":"RAIRO-Oper Res"},{"issue":"5","key":"1999_CR27","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.omega.2006.02.007","volume":"36","author":"Puri M C Sonia","year":"2008","unstructured":"Sonia Puri M C (2008) Two-stage time minimizing assignment problem. Omega 36(5):730\u2013740","journal-title":"Omega"},{"key":"1999_CR28","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.cor.2009.05.009","volume":"37","author":"A Volgenant","year":"2010","unstructured":"Volgenant A, Duin CW (2010) On a pair of job-machine assignment problems with two stages. Comput Oper Res 37:334\u2013340","journal-title":"Comput Oper Res"},{"key":"1999_CR29","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.cor.2017.05.003","volume":"86","author":"F Xie","year":"2017","unstructured":"Xie F, Butt MM, Li Z (2017) A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem. Comput Oper Res 86:124\u2013139","journal-title":"Comput Oper Res"},{"key":"1999_CR30","first-page":"1","volume":"2","author":"F Xie","year":"2022","unstructured":"Xie F, Sharma A, Li Z (2022) An alternate approach to solve two-level priority based assignment problem. Comput Optim Appl 2:1\u201344","journal-title":"Comput Optim Appl"},{"key":"1999_CR31","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.knosys.2017.09.024","volume":"137","author":"S Zhang","year":"2017","unstructured":"Zhang S, Guo H, Zhu K, Yu S, Li J (2017) Multistage assignment optimization for emergency rescue teams in the disaster chain. Knowl-Based Syst 137:123\u2013137","journal-title":"Knowl-Based Syst"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-01999-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-022-01999-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-01999-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T19:19:39Z","timestamp":1665170379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-022-01999-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,2]]},"references-count":31,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1999"],"URL":"https:\/\/doi.org\/10.1007\/s40314-022-01999-9","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2022,9,2]]},"assertion":[{"value":"29 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of data and material"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availabilty"}}],"article-number":"298"}}