A TABU SEARCH APPROACH TO THE GENERALIZED ASSIGNMENT PROBLEM

REFERENCES

• Amini , M. M. and Racer , M. 1995 . A hybrid heuristic for the generalized assignment problem . European Journal of Operational Research , 87 : 343 – 348 .
   Web of Science ®Google Scholar
• Baker , B. M. and Sheasby , J. 1999 . Accelerating the convergence of subgradient optimization . European Journal of Operational Research , 117 : 136 – 144 .
   Google Scholar
• Baker , M. and Sheasby , J. 1999 . Extensions to the generalized assignment heuristic for vehicle routing . European Journal of Operational Research , 119 : 147 – 157 .
   Web of Science ®Google Scholar
• Battiti , R. and Tecchiolli , G. 1994 . The reactive tabu search . ORSA Journal on Computing , 6 : 126 – 140 .
   Google Scholar
• Beasley , J. E. 1990 . OR-Library: Distributing test problems by electronic mail . Journal of Operational Research Society , 41 : 1069 – 1072 .
   Web of Science ®Google Scholar
• Cattrysse , D. , Degraeve , Z. and Tistaert , J. 1998 . Solving the generalized assignment problem using polyhedral . European Journal of Operational Research , 108 : 618 – 628 .
   Web of Science ®Google Scholar
• Cattrysse , D. M. , Salomon , L. N. and Van Wassenhove . 1994 . A set partitioning heuristic for the generalized assignment problem . European Journal of Operational Research , 72 : 167 – 174 .
   Web of Science ®Google Scholar
• Cattrysse , D. G. and Van Wassenhove , L. N. 1992 . A survey of algorithms for the generalized assignment problem . European Journal of Operational Research , 60 : 260 – 272 .
   Web of Science ®Google Scholar
• Caux , C. , Bruniaux , R. and Pierreval , H. 2000 . Cell formation with alternative process plans and machine capacity constraints: A new combined approach . International Journal of Production Economics , 64 : 279 – 284 .
   Web of Science ®Google Scholar
• Chu , P. C. and Beasley , J. E. 1997 . A genetic algorithm for the generalised assignment problem . Computers & Operations Research , 24 : 17 – 23 .
   Web of Science ®Google Scholar
• Fisher , M. L. , Jaikumar , R. and Van Wassenhove , L. N. 1986 . A multiplier adjustment method for the generalized assignment problem . Management Science , 32 : 1095 – 1103 .
   Web of Science ®Google Scholar
• Glover , F. 1989 . Tabu search—Part I . ORSA Journal on Computing , 1 : 190 – 206 .
   Google Scholar
• Glover , F. 1990 . Tabu search-Part II . ORSA Journal on Computing , 2 : 4 – 32 .
   Google Scholar
• Glover , F. and Laguna , M. 1997 . Tabu Search Boston : Kluwer Academic Publishers .
   Google Scholar
• Grigoriadis , M. D. , Tang , D. J. and Woo , L. S. 1975 . “ Considerations in the optimal synthesis of some communications networks ” . In Paper presented at 45th joint National ORSA/TIMS Meeting Boston, MA, , U.S.A.
   Google Scholar
• Haddadi , S. 1997 . Simple Lagrangian heuristic for the set covering problem . European Journal of Operational Research , 97 : 200 – 204 .
   Google Scholar
• Held , M. and Karp , R. M. 1971 . The traveling-salesman problem and minimum spanning trees: Part II . Mathematical Programming , 1 : 6 – 25 .
   Google Scholar
• Laguna , M. , Kelly , J. P. , González-Velarde , J. L. and Glover , F. 1995 . Tabu search for the multilevel generalized assignment problem . European Journal of Operational Research , 82 : 176 – 189 .
   Web of Science ®Google Scholar
• Lorena , L. A. N. and Narciso , M. G. 1996 . Relaxation heuristics for a generalized assignment problem . European Journal of Operational Research , 91 : 600 – 610 .
   Web of Science ®Google Scholar
• Martello , S. and Toth , P. 1981 . “ An algorithm for the generalized assignment problem ” . In Operations Research Edited by: Brans , J. P. 589 – 603 . Amsterdam : North-Holland .
   Google Scholar
• Martello , S. and Toth , P. 1990 . Knapsack Problems: Algorithms and Computer Implementations New York : John Wiley and Sons .
   Google Scholar
• Narciso , M. G. and Lorena , L. A. N. 1999 . Lagrangean/surrogate relaxation for generalized assignment problems . European Journal of Operational Research , 114 : 165 – 177 .
   Web of Science ®Google Scholar
• Osman , I. H. 1995 . Heuristics for the generalized assignment problem: Simulated annealing and tabu search approaches . OR Spektrum , 17 : 211 – 225 .
   Web of Science ®Google Scholar
• Rolland , E. , Schilling , D. A. and Current , J. R. 1996 . An efficient tabu search procedure for the p-Median problem . European Journal of Operational Research , 96 : 329 – 342 .
   Google Scholar
• Ross , G. T. and Soland , R. M. 1975 . A branch-and-bound algorithm for the generalized assignment problem . Mathematical Programming , 8 : 91 – 103 .
   Web of Science ®Google Scholar
• Sun , D. , Lin , L. and Batta , R. 1995 . Cell formation using tabu search . Computers & Industrial Engineering , 28 : 485 – 494 .
   Web of Science ®Google Scholar
• Sun , M. , Aronson , J. E. , McKeown , P. G. and Drinka , D. 1998 . A tabu search heuristic procedure for the fixed charge transportation problem . European Journal of Operational Research , 106 : 441 – 456 .
   Web of Science ®Google Scholar
• Yagiura , M. , Yamaguchi , T. and Ibaraki , T. 1998 . A variable depth search algorithm with branching search for the generalized assignment problem . Optimization Methods and Software , 10 : 419 – 441 .
   Web of Science ®Google Scholar
• Yagiura , M. , Ibaraki , T. and Glover , F. An ejection chain approach for the generalized assignment problem . INFORMS Journal on Computing , (to appear)
   Google Scholar