Preprocessing for static and dynamic facility layout problems

摘要: Most facility layout problems have departments with unequal areas and significant rearrangement costs. This paper describes a model improved algorithm which simultaneously handles these parameters. An existing solves the dynamic facilities problem while permitting to areas. One part of mixed integer programming find desired block diagram layout. large, complex could only be solved optimally for small problems. Therefore preprocessing method was developed prespecify certain obvious department pair orientations, had previously required binary variables. The uses estimated location, sizes, flow costs determine probable variable values. Then, revised branch bound strategy less orientations. Test results show cost reduction on variety published problems, feasible solutions un...