Sharing clearances to improve machine layout
针对半导体制造中的双行布局问题，通过引入机器间可共享的间距，在减少布局面积和物料搬运成本上取得7-10%的改进，并提出混合多目标禁忌搜索与启发式规则的高效求解方法。
This paper considers a double-row layout problem with shared clearances in the context of semiconductor manufacturing. By sharing some clearances, reductions in both layout area and material handling cost of approximately 7–10% are achieved. Along with minimal clearances for separating adjacent machines, clearances that can be shared by adjacent machines are considered. The shared clearances may be located on either or both sides of machines. A mixed integer linear programming formulation of this problem is established, with the objective to minimise both material flow cost and layout area. A hybrid approach combining multi-objective tabu search and heuristic rules is proposed to solve it. Computational results show that the hybrid approach is very effective for this problem and finds machine layouts with reduced areas and handling costs by exploiting shared clearances.