Management Science and Financial Engineering

  • 제16권1호
  • /
  • Pages.47-57
  • /
  • 2010
  • /
  • 2287-2043(pISSN)
  • /
  • 2287-2361(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

A Novel Integer Programming Approach to the One-Dimensional Facility Layout Problem

  • Lee, Tae-Han (Department of Industrial and Information Systems Engineering, Chonbuk National University) ;
  • Park, Kyung-Chul (School of Business, Myongji University)
  • 투고 : 2009.12.14
  • 심사 : 2010.01.13
  • 발행 : 2010.05.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We present a new integer programming formulation and a class of valid inequalities for solving the one-dimensional facility layout problem, which leads to a very efficient solution method for the problem.

키워드

참고문헌

  1. Amaral, A. R. S., "An exact approach to the one-dimensional facility layout problem," Operations Research 56 (2008), 1026-1033. https://doi.org/10.1287/opre.1080.0548
  2. Anjos, M. F., "A. Kennings, and A. Vannelli, A semidefinite optimization approach for the single-row facility layout problem with unequal dimensions," Discrete Optim. 2 (2005), 113-122. https://doi.org/10.1016/j.disopt.2005.03.001
  3. Barnhart, C., C. A. Hane, and P. H. Vance, "Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems," Operations Research 48 (2000), 318-326. https://doi.org/10.1287/opre.48.2.318.12378
  4. Grotschel, M., M. Jiinger, and G. Reinelt, "A cutting plane algorithm for the linear ordering problem," Operations Research 32 (1984), 1195-1120. https://doi.org/10.1287/opre.32.6.1195
  5. Grotschel, M., M. Jiinger, and G. Reinelt, "Facets of the linear ordering polytope," Math. Programming 33 (1984), 43-60.
  6. Heragu, S. S. and A. Kusiak, "Machine layout problem in flexible manufacturing systems," Operations Research 36 (1988), 258-268. https://doi.org/10.1287/opre.36.2.258
  7. Heragu, S. S. and A. Kusiak, "Efficient models for the facility layout problem," Eur. J. Oper. Res. 53 (1991), 1-13. https://doi.org/10.1016/0377-2217(91)90088-D
  8. Nemhauser, G. L. and L. A. Wolsey, "Integer and Combinatorial Optimization," John Wiely and Sons, Inc. 1988.
  9. Picard, J. and M. Queyranne, "On the one-dimensional space allocation problem," Operations Research 29 (1981), 371-391. https://doi.org/10.1287/opre.29.2.371
  10. Simmons, D. M., "One-dimensional space allocation: An ordering algorithm," Operations Research 17 (1969), 812-826. https://doi.org/10.1287/opre.17.5.812