{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T19:00:39Z","timestamp":1781895639263,"version":"3.54.5"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T00:00:00Z","timestamp":1529625600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001412","name":"Council of Scientific and Industrial Research","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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s10878-018-0318-2","type":"journal-article","created":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T14:18:11Z","timestamp":1529677091000},"page":"713-736","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An improved algorithm for two stage time minimization assignment problem"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6099-6848","authenticated-orcid":false,"given":"Ekta","family":"Jain","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kalpana","family":"Dahiya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anuj","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vanita","family":"Verma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,6,22]]},"reference":[{"key":"318_CR1","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":"318_CR2","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":"318_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0167-6377(92)90103-A","volume":"12","author":"RD Armstrong","year":"1992","unstructured":"Armstrong RD, Zhiying J (1992) Solving linear bottleneck assignment problems via strong spanning trees. Oper Res Lett 12:179\u2013180","journal-title":"Oper Res Lett"},{"key":"318_CR4","first-page":"191","volume":"24","author":"S Bansal","year":"1980","unstructured":"Bansal S, Puri MC (1980) A min\u2013max problem. ZOR 24:191\u2013200","journal-title":"ZOR"},{"key":"318_CR5","first-page":"75","volume":"6","author":"HL Bhatia","year":"1977","unstructured":"Bhatia HL (1977) Time minimizing assignment problem. SCIMA 6:75\u201383","journal-title":"SCIMA"},{"key":"318_CR6","doi-asserted-by":"crossref","first-page":"8","DOI":"10.21136\/CPM.1971.117707","volume":"96","author":"A Brandt","year":"1971","unstructured":"Brandt A, Intrator Y (1971) The assignment problem with three job categories. Casopis pro Pestovani Matematiky 96:8\u201311","journal-title":"Casopis pro Pestovani Matematiky"},{"key":"318_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF02243552","volume":"27","author":"G Carpaneto","year":"1981","unstructured":"Carpaneto G, Toth P (1981) Algorithm for the solution of the bottleneck assignment problem. Computing 27:179\u2013187","journal-title":"Computing"},{"key":"318_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02240182","volume":"33","author":"U Derigs","year":"1984","unstructured":"Derigs U (1984) Alternate strategies for solving bottleneck assignment problems-analysis and computational results. Computing 33:95\u2013106","journal-title":"Computing"},{"key":"318_CR9","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"},{"key":"318_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J Edmonds","year":"1970","unstructured":"Edmonds J, Fulkerson DR (1970) Bottleneck extrema. J Comb Theory 8:299\u2013306","journal-title":"J Comb Theory"},{"key":"318_CR11","doi-asserted-by":"crossref","DOI":"10.1515\/9781400875184","volume-title":"Flows in networks","author":"DR Ford","year":"1962","unstructured":"Ford DR, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton"},{"key":"318_CR12","unstructured":"Fulkerson R, Glicksberg I, Gross O (1953) A production line assignment problem. Technical Report RM-1102, Rand Corporation, Sta. Monica, CA"},{"key":"318_CR13","doi-asserted-by":"publisher","first-page":"1747","DOI":"10.1287\/opre.19.7.1747","volume":"19","author":"R Garfinkel","year":"1971","unstructured":"Garfinkel R (1971) An improved algorithm for the bottleneck assignment problem. Oper Res 19:1747\u20131751","journal-title":"Oper Res"},{"key":"318_CR14","unstructured":"Gross O (1959) The bottleneck assignment problem. Technical Report P-1630, The Rand Corporation, Sta. Monica, CA"},{"issue":"7","key":"318_CR15","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"},{"key":"318_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res Logist Q 2:83\u201397","journal-title":"Naval Res Logist Q"},{"key":"318_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1093\/comjnl\/6.3.241","volume":"6","author":"ES Page","year":"1963","unstructured":"Page ES (1963) A note on assignment problems. Comput J 6:241\u2013243","journal-title":"Comput J"},{"issue":"3","key":"318_CR18","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"},{"issue":"81","key":"318_CR19","first-page":"81","volume":"17","author":"TA Porsching","year":"1963","unstructured":"Porsching TA (1963) Matrix assignments and an associated min\u2013max problem. Math Comput 17(81):81\u201384","journal-title":"Math Comput"},{"issue":"7","key":"318_CR20","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":"4","key":"318_CR21","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/BF00933089","volume":"21","author":"A Ravindran","year":"1977","unstructured":"Ravindran A, Ramaswami V (1977) On the bottleneck assignment problem. J Optim Theory Appl 21(4):451\u2013458","journal-title":"J Optim Theory Appl"},{"issue":"6","key":"318_CR22","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1057\/jors.1981.99","volume":"32","author":"CR Seshan","year":"1981","unstructured":"Seshan CR (1981) Some generalisations of the time minimising assignment problem. J Oper Res Soc 32(6):489\u2013494","journal-title":"J Oper Res Soc"},{"key":"318_CR23","doi-asserted-by":"crossref","unstructured":"Sonia, Puri MC (2008) Two-stage time minimizing assignment problem. Omega 36:730\u2013740","DOI":"10.1016\/j.omega.2006.02.007"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0318-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0318-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0318-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T04:59:03Z","timestamp":1604465943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0318-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,22]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["318"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0318-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,22]]},"assertion":[{"value":"22 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}