作者: Chase C. Murray , Alice E. Smith , Zeqiang Zhang
DOI: 10.1080/00207543.2013.803168
关键词: Context (language use) 、 Special case 、 Mathematical optimization 、 Mathematics 、 Integer programming 、 Local search (optimization) 、 Linear programming 、 Solver 、 Material flow 、 Heuristic (computer science)
摘要: AbstractThe double row layout problem (DRLP) consists of arranging a number rectangular machines varying widths on either side corridor to minimize the total cost material handling for products that move between these machines. This arises in context many production environments, most notably semiconductor manufacturing. Because DRLP contains both combinatorial and continuous aspects, traditional solution approaches are not well suited obtain solutions within reasonable time. Moreover, previous this did consider asymmetric flows. In paper, an effective local search procedure featuring linear programming is proposed solving with flows (symmetric being special case). approach compared against several constructive heuristics obtained by commercial mixed integer solver evaluate its performance. Computational results show heuristic ...