Detailed layout planning for irregularly-shaped machines with transportation path design

被引:23
作者
Bock, Stefan
Hoberg, Kai
机构
[1] Univ Gesamthsch Paderborn, Int Grad Sch Dynam Intelligent Syst, D-33098 Paderborn, Germany
[2] Univ Cologne, Dept Supply Chain Management & Management Sci, D-50923 Cologne, Germany
关键词
facilities planning and design; combinatorial optimization; layout planning; heuristics; shortest path; MANUFACTURING SYSTEMS; FACILITIES LAYOUT; ALGORITHM; SEARCH; HEURISTICS; SINGLE; GRAPH;
D O I
10.1016/j.ejor.2005.11.011
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In order to obtain a competitive level of productivity in a manufacturing system, efficient machine or department arrangements and appropriate transportation path structures are of considerable importance. By defining a production system's basic structure and material flows, the layout determines its operational performance over the long term. However, most approaches proposed in the literature provide only a block layout, which neglects important operational details. By contrast, in this paper, we introduce approaches to planning layouts at a more detailed level. Hence, this present paper introduces an integrated approach which allows a more detailed layout planning by simultaneously determining machine arrangement and transportation paths. Facilities to be arranged as well as the entire layout may have irregular shapes and sizes. By assigning specific attributes to certain layout subareas, application-dependent barriers within the layout, like existing walls or columns, can be incorporated. We introduce a new mathematical layout model and develop several improvement procedures. An analysis of the computational experiments shows that more elaborate heuristics using variable neighborhoods can generate promising layout configurations. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:693 / 718
页数:26
相关论文
共 42 条
[1]   Tabu search based heuristics for multi-floor facility layout [J].
Abdinnour-Helm, S ;
Hadley, SW .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (02) :365-383
[2]  
Apple JamesM., 1977, Plant layout and material handling
[3]   A HEURISTIC ALGORITHM AND SIMULATION APPROACH TO RELATIVE LOCATION OF FACILITIES [J].
ARMOUR, GC ;
BUFFA, ES .
MANAGEMENT SCIENCE, 1963, 9 (02) :294-309
[4]   Dynamic layout algorithms: a state-of-the-art survey [J].
Balakrishnan, J ;
Cheng, CH .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1998, 26 (04) :507-521
[5]   An improved pair-wise exchange heuristic for the dynamic plant layout problem [J].
Balakrishnan, J ;
Cheng, CH ;
Conway, DG .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (13) :3067-3077
[6]  
BOCK S, 2000, P C I OP RES MAN SCI, P951
[7]  
BOCK S, 2005, SUPPLY CHAIN MANAG, P531
[8]   Optimizing simulated annealing schedules with genetic programming [J].
Bolte, A ;
Thonemann, UW .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 92 (02) :402-416
[9]   AN IMPROVEMENT-TYPE LAYOUT ALGORITHM FOR SINGLE AND MULTIPLE-FLOOR FACILITIES [J].
BOZER, YA ;
MELLER, RD ;
ERLEBACHER, SJ .
MANAGEMENT SCIENCE, 1994, 40 (07) :918-932
[10]  
Burkard R E., 1998, Handbook of combinatorial optimization, P1713