The three-dimensional fixed charge transportation problem is an extension of the classical three-dimensional transportation problem in which a fixed cost is incurred for every origin. In the present paper three-dimensional fixed charge bi-criterion indefinite quadratic transportation problem, giving the same priority to cost as well as time, is studied. An algorithm to find the efficient cost-time trade off pairs in a three dimensional fixed charge bi-criterion indefinite quadratic transportation problem is developed. The algorithm is illustrated with the help of a numerical example.