{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T11:23:27Z","timestamp":1706268207904},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0377-2217(97)00392-5","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"167-173","source":"Crossref","is-referenced-by-count":12,"title":["Multiple bottleneck assignment problem"],"prefix":"10.1016","volume":"112","author":[{"given":"Y.P.","family":"Aneja","sequence":"first","affiliation":[]},{"given":"A.P.","family":"Punnen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00392-5_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0305-0548(86)90060-2","article-title":"Bottleneck assignment problem under categorization","volume":"13","author":"Aggarwal","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00392-5_BIB2","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1057\/jors.1993.116","article-title":"Categorized assignment scheduling: A tabu search approach","volume":"44","author":"Punnen","year":"1993","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00392-5_BIB3","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1057\/jors.1981.99","article-title":"Some generalizations of the time minimizing assignment problem","volume":"32","author":"Seshan","year":"1981","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00392-5_BIB4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(92)90165-7","article-title":"Minimum weight perfect bipartite matching and spanning trees under categorization","volume":"39","author":"Richey","year":"1992","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00392-5_BIB5","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The travelling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00392-5_BIB6","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01589111","article-title":"Solving combinatorial problems with combined minmax-minsum objective and applications","volume":"45","author":"Minoux","year":"1989","journal-title":"Mathematical Programming Series B"},{"key":"10.1016\/S0377-2217(97)00392-5_BIB7","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/0305-0548(94)90084-1","article-title":"On combined minmax-minsum optimization","volume":"21","author":"Punnen","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00392-5_BIB8","unstructured":"E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt Reinhart & Winston, NY, 1976"},{"key":"10.1016\/S0377-2217(97)00392-5_BIB9","doi-asserted-by":"crossref","unstructured":"H. Ale, N. Blum, K. Mehlhorn, M. Paul, Computing a maximal cardinality matching in a bipartite graph in time On1.5m\/logn, Information Processing Letters 37 (1991) 237\u2013240","DOI":"10.1016\/0020-0190(91)90195-N"},{"key":"10.1016\/S0377-2217(97)00392-5_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangean method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00392-5_BIB11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0305-0548(93)90003-2","article-title":"The multiple bottleneck transportation problem","volume":"20","author":"Wild","year":"1993","journal-title":"Computers and Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003925?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003925?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T23:24:38Z","timestamp":1556148278000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797003925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0377221797003925"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00392-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}