the bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. to deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. we describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an application of tabu search. the method is illustrated on a numerical example, demonstrating the eectiveness of the tabu search method. numerical results are compared for both fuzzy and crisp versions of the problem.