{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:23:37Z","timestamp":1783610617759,"version":"3.55.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/s0305-0548(96)00032-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"17-23","source":"Crossref","is-referenced-by-count":429,"title":["A genetic algorithm for the generalised assignment problem"],"prefix":"10.1016","volume":"24","author":[{"given":"P.C.","family":"Chu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.E.","family":"Beasley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00032-9_BIB1","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","article-title":"A survey of algorithms for the generalized assignment problem","volume":"60","author":"Cattrysse","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0305-0548(96)00032-9_BIB2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01720977","article-title":"Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches","volume":"17","author":"Osman","year":"1995","journal-title":"OR Spektrum"},{"key":"10.1016\/S0305-0548(96)00032-9_BIB3","doi-asserted-by":"crossref","unstructured":"Beasley, J. E. and Chu, P. C., A Genetic Algorithm for the Set Covering Problem. Eur. J. Oper. Res. (in press).","DOI":"10.1016\/0377-2217(95)00159-X"},{"key":"10.1016\/S0305-0548(96)00032-9_BIB4","article-title":"A genetic algorithm for the set partitioning problem","author":"Chu","year":"1995"},{"key":"10.1016\/S0305-0548(96)00032-9_BIB5","article-title":"Set partitioning approaches to combinatorial optimization problems","author":"Cattrysse","year":"1990"},{"key":"10.1016\/S0305-0548(96)00032-9_BIB6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(94)90338-7","article-title":"A set partitioning heuristic for the generalized assignment problem","volume":"72","author":"Cattrysse","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0305-0548(96)00032-9_BIB7","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1287\/mnsc.40.7.868","article-title":"A rigorous computational comparison of alternative solution methods for the generalized assignment problem","volume":"40","author":"Amini","year":"1994","journal-title":"Mgmt Sci."},{"key":"10.1016\/S0305-0548(96)00032-9_BIB8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0305-0548(79)90028-5","article-title":"An effective subgradient algorithm for the generalized assignment problem","volume":"6","author":"Klastorin","year":"1979","journal-title":"Comp. Oper. Res."},{"key":"10.1016\/S0305-0548(96)00032-9_BIB9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/1520-6750(199203)39:2<137::AID-NAV3220390202>3.0.CO;2-D","article-title":"A linear relaxation heuristic for the generalised assignment problem","volume":"39","author":"Trick","year":"1992","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0305-0548(96)00032-9_BIB10","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","article-title":"A multiplier adjustment method for the generalized assignment problem","volume":"32","author":"Fisher","year":"1986","journal-title":"Mgmt Sci."},{"key":"10.1016\/S0305-0548(96)00032-9_BIB11","first-page":"259","article-title":"Linear assignment problems","volume":"31","author":"Martello","year":"1987","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(96)00032-9_BIB12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","article-title":"A branch and bound algorithm for the generalized assignment problem","volume":"8","author":"Ross","year":"1975","journal-title":"math. Prog."},{"key":"10.1016\/S0305-0548(96)00032-9_BIB13","series-title":"Operational Research '81","first-page":"589","article-title":"An algorithm for the generalized assignment problem","author":"Martello","year":"1981"},{"key":"10.1016\/S0305-0548(96)00032-9_BIB14","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000329?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000329?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:20:50Z","timestamp":1555190450000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0305054896000329"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00032-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}