IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v54y2016i14p4272-4285.html
   My bibliography  Save this article

Sharing clearances to improve machine layout

Author

Listed:
  • X.Q. Zuo
  • C.C. Murray
  • A.E. Smith

Abstract

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.

Suggested Citation

  • X.Q. Zuo & C.C. Murray & A.E. Smith, 2016. "Sharing clearances to improve machine layout," International Journal of Production Research, Taylor & Francis Journals, vol. 54(14), pages 4272-4285, July.
    • Handle: RePEc:taf:tprsxx:v:54:y:2016:i:14:p:4272-4285
    DOI: 10.1080/00207543.2016.1142134
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2016.1142134
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2016.1142134?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Citations

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


    Cited by:

    1. Dahlbeck, Mirko & Fischer, Anja & Fischer, Frank, 2020. "Decorous combinatorial lower bounds for row layout problems," European Journal of Operational Research, Elsevier, vol. 286(3), pages 929-944.
    2. 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.
    3. Anjos, Miguel F. & Fischer, Anja & Hungerländer, Philipp, 2018. "Improved exact approaches for row layout problems with departments of equal length," European Journal of Operational Research, Elsevier, vol. 270(2), pages 514-529.
    4. Dahlbeck, Mirko, 2021. "A mixed-integer linear programming approach for the T-row and the multi-bay facility layout problem," European Journal of Operational Research, Elsevier, vol. 295(2), pages 443-462.

    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:taf:tprsxx:v:54:y:2016:i:14:p:4272-4285. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.