IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v189y2008i3p609-623.html
   My bibliography  Save this article

Exact solution procedures for the balanced unidirectional cyclic layout problem

Author

Listed:
  • Öncan, Temel
  • AltInel, I. Kuban

Abstract

In this paper, we consider the balanced unidirectional cyclic layout problem (BUCLP) arising in the determination of workstation locations around a closed loop conveyor system, in the allocation of cutting tools on the sites around a turret, in the positioning of stations around a unidirectional single loop AGV path. BUCLP is known to be NP-Complete. One important property of this problem is the balanced material flow assumption where the material flow is conserved at every workstation. We first develop a branch-and-bound procedure by using the special material flow property of the problem. Then, we propose a dynamic programming algorithm, which provides optimum solutions for instances with up to 20 workstations due to memory limitations. The branch and bound procedure can solve problems with up to 50 workstations.

Suggested Citation

  • Öncan, Temel & AltInel, I. Kuban, 2008. "Exact solution procedures for the balanced unidirectional cyclic layout problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 609-623, September.
    • Handle: RePEc:eee:ejores:v:189:y:2008:i:3:p:609-623
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)01172-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Potts, C. N. & Whitehead, J. D., 2001. "Workload balancing and loop layout in the design of a flexible manufacturing system," European Journal of Operational Research, Elsevier, vol. 129(2), pages 326-336, March.
    2. Kouvelis, P & Chiang, W-C & Kiran, AS, 1992. "A survey of layout issues in flexible manufacturing systems," Omega, Elsevier, vol. 20(3), pages 375-390, May.
    3. Carlier, Jacques & Rebai, Ismail, 1996. "Two branch and bound algorithms for the permutation flow shop problem," European Journal of Operational Research, Elsevier, vol. 90(2), pages 238-251, April.
    4. Jean-Claude Picard & Maurice Queyranne, 1981. "On the One-Dimensional Space Allocation Problem," Operations Research, INFORMS, vol. 29(2), pages 371-391, April.
    5. Panagiotis Kouvelis & Michael W. Kim, 1992. "Unidirectional Loop Network Layout Problem in Automated Manufacturing Systems," Operations Research, INFORMS, vol. 40(3), pages 533-550, June.
    6. Tansel, Barbaros C. & Bilen, Canan, 1998. "Move based heuristics for the unidirectional loop network layout problem," European Journal of Operational Research, Elsevier, vol. 108(1), pages 36-48, July.
    7. C. N. Potts, 1985. "A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time," Management Science, INFORMS, vol. 31(10), pages 1300-1311, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ghosh, Diptesh, 2015. "A Quadratic Programming Formulation of the Equidistant Bi-directional Loop Layout Problem," IIMA Working Papers WP2015-10-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Gintaras Palubeckis, 2020. "An Approach Integrating Simulated Annealing and Variable Neighborhood Search for the Bidirectional Loop Layout Problem," Mathematics, MDPI, vol. 9(1), pages 1-30, December.
    3. Asef-Vaziri, Ardavan & Jahandideh, Hossein & Modarres, Mohammad, 2017. "Loop-based facility layout design under flexible bay structures," International Journal of Production Economics, Elsevier, vol. 193(C), pages 713-725.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank & Hungerländer, Philipp & Maier, Kerstin, 2023. "Exact approaches for the combined cell layout problem," European Journal of Operational Research, Elsevier, vol. 305(2), pages 530-546.
    2. Keller, Birgit & Buscher, Udo, 2015. "Single row layout models," European Journal of Operational Research, Elsevier, vol. 245(3), pages 629-644.
    3. Potts, C. N. & Whitehead, J. D., 2001. "Workload balancing and loop layout in the design of a flexible manufacturing system," European Journal of Operational Research, Elsevier, vol. 129(2), pages 326-336, March.
    4. Nearchou, Andreas C., 2006. "Meta-heuristics from nature for the loop layout design problem," International Journal of Production Economics, Elsevier, vol. 101(2), pages 312-328, June.
    5. Asef-Vaziri, Ardavan & Jahandideh, Hossein & Modarres, Mohammad, 2017. "Loop-based facility layout design under flexible bay structures," International Journal of Production Economics, Elsevier, vol. 193(C), pages 713-725.
    6. Asef-Vaziri, Ardavan & Laporte, Gilbert, 2005. "Loop based facility planning and material handling," European Journal of Operational Research, Elsevier, vol. 164(1), pages 1-11, July.
    7. A. R. S. Amaral, 2022. "A heuristic approach for the double row layout problem," Annals of Operations Research, Springer, vol. 316(2), pages 1-36, September.
    8. Ghosh, Diptesh, 2011. "An Exponential Neighborhood Local Search Algorithm for the Single Row Facility Location Problem," IIMA Working Papers WP2011-08-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    9. Mariem Besbes & Marc Zolghadri & Roberta Costa Affonso & Faouzi Masmoudi & Mohamed Haddar, 2020. "A methodology for solving facility layout problem considering barriers: genetic algorithm coupled with A* search," Journal of Intelligent Manufacturing, Springer, vol. 31(3), pages 615-640, March.
    10. Hungerländer, Philipp & Anjos, Miguel F., 2015. "A semidefinite optimization-based approach for global optimization of multi-row facility layout," European Journal of Operational Research, Elsevier, vol. 245(1), pages 46-61.
    11. Hassan, Mohsen M. D., 1995. "Layout design in group technology manufacturing," International Journal of Production Economics, Elsevier, vol. 38(2-3), pages 173-188, March.
    12. Uma Kothari & Diptesh Ghosh, 2012. "A Competitive Genetic Algorithm for Single Row Facility Layout," Working Papers id:4915, eSocialSciences.
    13. M Haouari & T Ladhari, 2007. "Minimizing maximum lateness in a flow shop subject to release dates," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 62-72, January.
    14. Kothari, Ravi & Ghosh, Diptesh, 2012. "Path Relinking for Single Row Facility Layout," IIMA Working Papers WP2012-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    15. Vis, Iris F.A., 2006. "Survey of research in the design and control of automated guided vehicle systems," European Journal of Operational Research, Elsevier, vol. 170(3), pages 677-709, May.
    16. Kothari, Ravi & Ghosh, Diptesh, 2013. "Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods," European Journal of Operational Research, Elsevier, vol. 224(1), pages 93-100.
    17. Tansel, Barbaros C. & Bilen, Canan, 1998. "Move based heuristics for the unidirectional loop network layout problem," European Journal of Operational Research, Elsevier, vol. 108(1), pages 36-48, July.
    18. Cheng, Jinliang & Steiner, George & Stephenson, Paul, 2001. "A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times," European Journal of Operational Research, Elsevier, vol. 130(3), pages 559-575, May.
    19. Chatterjee A K & Mukherjee, Saral, 2006. "Unified Concept of Bottleneck," IIMA Working Papers WP2006-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    20. S Yanai & T Fujie, 2006. "A three-machine permutation flow-shop problem with minimum makespan on the second machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(4), pages 460-468, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:189:y:2008:i:3:p:609-623. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.