{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:01:33Z","timestamp":1773244893193,"version":"3.50.1"},"reference-count":46,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"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":[[1998,10]]},"DOI":"10.1016\/s0377-2217(97)00266-x","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"314-325","source":"Crossref","is-referenced-by-count":21,"title":["A variant of time minimizing assignment problem"],"prefix":"10.1016","volume":"110","author":[{"given":"Shalini","family":"Arora","sequence":"first","affiliation":[]},{"given":"M.C.","family":"Puri","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00266-X_BIB1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1090\/dimacs\/016\/02","article-title":"Improved linear programming based lower bounds for the quadratic assignment problem","volume":"16","author":"Adams","year":"1994","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0377-2217(83)90312-0","article-title":"The assignment problem under categorized jobs","volume":"14","author":"Aggarwal","year":"1983","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0377-2217(97)00266-X_BIB3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0305-0548(86)90060-2","article-title":"Bottleneck assignment problems under categorization","volume":"13","author":"Aggarwal","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane algorithm for mixed 0\u20131 programs","volume":"58","author":"Balas","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584319","article-title":"The alternating basis algorithm for assignment problems","volume":"13","author":"Barr","year":"1977","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/nav.3800270104","article-title":"Bender's partitioning scheme applied to a new formulation of the quadratic assignment problem","volume":"27","author":"Bazzara","year":"1980","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB7","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1057\/jors.1982.210","article-title":"On the use of exact and heuristic cutting plane methods for the quadratic assignment problem","volume":"33","author":"Bazzara","year":"1982","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB8","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1287\/opre.38.1.178","article-title":"The constrained bottleneck problem in networks","volume":"38","author":"Berman","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB9","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/BF01584237","article-title":"A new algorithm for the assignment problem","volume":"21","author":"Bertsekas","year":"1981","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB10","first-page":"75","article-title":"Time minimizing assignment problem","volume":"6","author":"Bhatia","year":"1977","journal-title":"Systems and Cybernetics in Management"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB11","series-title":"Assignment problems in distributed and parallel computing","author":"Bokhari","year":"1987"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB12","doi-asserted-by":"crossref","first-page":"8","DOI":"10.21136\/CPM.1971.117707","article-title":"The assignment problem with three job categories","volume":"96","author":"Brandt","year":"1971","journal-title":"Casopis Pro Pestovani Matematiky"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1090\/dimacs\/016\/05","article-title":"On the biquadratic assignment problem","volume":"16","author":"Burkard","year":"1994","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB14","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","article-title":"A state-of-art review of parallel-machine scheduling research","volume":"47","author":"Cheng","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB15","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1111\/j.1540-5915.1980.tb01163.x","article-title":"Scheduling to minimum makespan on unequal parallel processors","volume":"11","author":"De","year":"1980","journal-title":"Decision Science"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB16","series-title":"Sequencing and Scheduling \u2014 Introduction to the Mathematics of the Job Shop","author":"French","year":"1982"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0377-2217(83)90078-4","article-title":"Complexity of a 3-dimensional assignment problem","volume":"14","author":"Frieze","year":"1983","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0166-218X(83)90018-5","article-title":"On the quadratic assignment problem","volume":"5","author":"Frieze","year":"1983","journal-title":"Discrete and Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB19","first-page":"1717","article-title":"An improved algorithm for bottleneck assignment problem","volume":"18","author":"Garfinkel","year":"1971","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB20","series-title":"Deterministic Scheduling Theory","author":"Parker","year":"1995"},{"issue":"3","key":"10.1016\/S0377-2217(97)00266-X_BIB21","first-page":"209","article-title":"The maximum capacity routes: A lexisearch approach","volume":"8","author":"Ghose","year":"1971","journal-title":"Opsearch"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB22","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0110022","article-title":"Optimal and suboptimal algorithms for the quadratic assignment problem","volume":"10","author":"Gilmore","year":"1962","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"3","key":"10.1016\/S0377-2217(97)00266-X_BIB23","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230040302","article-title":"Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems","volume":"4","author":"Glover","year":"1974","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB24","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1287\/opre.23.6.1167","article-title":"Bench marks comparing transportation codes based on primal simplex and primal-dual algorithms","volume":"23","author":"Hatch","year":"1975","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB25","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1287\/opre.28.4.969","article-title":"Solving the assignment problem by relaxation","volume":"28","author":"Hung","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB26","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and the location of economic activities","volume":"25","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for assignment problem","volume":"2","author":"Kuhn","year":"1956","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB28","series-title":"Networks and Matroids","article-title":"Combinatorial optimization","author":"Lawler","year":"1976"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB29","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","article-title":"The quadratic assignment problem","volume":"9","author":"Lawler","year":"1963","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB30","series-title":"Report BS-R8909","article-title":"Sequencing and Scheduling: Algorithms and Complexity","author":"Lawler","year":"1989"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB31","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1080\/02331938508843013","article-title":"The three dimensional bottleneck assignment problem and its variants","volume":"16","author":"Malhotra","year":"1985","journal-title":"Optimization"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB32","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1090\/dimacs\/016\/13","article-title":"Difficulties of exact methods for solving the quadratic assignment problem","volume":"16","author":"Mautor","year":"1994","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"issue":"4","key":"10.1016\/S0377-2217(97)00266-X_BIB33","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1287\/opre.34.4.560","article-title":"Resource constraint assignment scheduling","volume":"34","author":"Mazzola","year":"1986","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB34","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1287\/opre.31.2.277","article-title":"Implementation and testing of a primal-dual algorithm for the assignment problem","volume":"31","author":"McGinnis","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB35","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1287\/opre.16.3.682","article-title":"An algorithm for ranking all the assignments in order of increasing cost","volume":"16","author":"Murty","year":"1968","journal-title":"Operations Research"},{"issue":"1\u20132","key":"10.1016\/S0377-2217(97)00266-X_BIB36","first-page":"35","article-title":"Enumeration of all optimal job sequence","volume":"12","author":"Pandit","year":"1975","journal-title":"Opsearch"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB37","series-title":"8th Annual Convention of Operational Research Society of India","first-page":"22","article-title":"Allocation of sources and destinations","author":"Pandit","year":"1975"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB38","first-page":"351","article-title":"A parallel algorithm for the quadratic assignment problem","volume":"89","author":"Pardalos","year":"1989"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB39","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1002\/1520-6750(199204)39:3<389::AID-NAV3220390308>3.0.CO;2-6","article-title":"On the solution of a stochastic bottleneck assignment problem and its variants","volume":"39","author":"De","year":"1992","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB40","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/BF00933089","article-title":"On the bottleneck assignment problem","volume":"21","author":"Ravindran","year":"1977","journal-title":"Journal of Optimization Theory And Applications"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB41","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-218X(87)90022-9","article-title":"A parallel branch and bound algorithm for the quadratic assignment problem","volume":"18","author":"Roucairol","year":"1987","journal-title":"Discrete and Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB42","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1057\/jors.1981.99","article-title":"Some generalisations of time minimizing assignment problem","volume":"32","author":"Seshan","year":"1981","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB43","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1145\/321724.321734","article-title":"Accelerated algorithms for labeling and relabeling of trees with applications to distribution problems","volume":"19","author":"Srinivasan","year":"1972","journal-title":"Journal of Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB44","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1145\/321752.321754","article-title":"Benefit cost analysis of coding techniques for the primal transportation algorithm","volume":"20","author":"Srinivasan","year":"1973","journal-title":"Journal of Association for Computing Machinery"},{"issue":"1","key":"10.1016\/S0377-2217(97)00266-X_BIB45","first-page":"45","article-title":"Some special cases of assignment problems","volume":"16","author":"Subrahmanyam","year":"1979","journal-title":"Opsearch"},{"key":"10.1016\/S0377-2217(97)00266-X_BIB46","article-title":"Optimization over a polyhedral domain: Some Aspects","author":"Verma","year":"1990"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179700266X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179700266X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T08:04:06Z","timestamp":1620633846000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179700266X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S037722179700266X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00266-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}