Now showing items 1-3 of 3

    • Move based heuristics for the unidirectional loop network layout problem 

      Tansel, B. C.; Bilen, C. (Elsevier, 1998-07-01)
      We consider the loop network layout problem in a manufacturing system where n machines must be placed in n available locations around a loop to minimize the total flow distance. The formulation of the problem results in a ...
    • New heuristic for the dynamic layout problem 

      Erel, E.; Ghosh, J. B.; Simon, J. T. (Palgrave Macmillan, 2003)
      The dynamic layout problem addresses the situation where the traffic among the various units within a facility changes over time. Its objective is to determine a layout for each period in a planning horizon such that the ...
    • Tree network 1-median location with interval data: a parameter space-based approach 

      Demir, M. H.; Tansel, B. Ç.; Scheuenstuhl, G. F. (Taylor & Francis, 2005)
      We consider a family of 1-median location problems on a tree network where the vertex weights are ranges rather than point values. We define a new framework for making sound decisions under uncertainty which is primarily ...