IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v77y1998i0p79-9510.1023-a1018933613215.html
   My bibliography  Save this article

An integrated formulation of manufacturing cell formation with capacity planning and multiple routings

Author

Listed:
  • Vishwanath Ramabhatta
  • Rakesh Nagi

Abstract

This paper presents an integrated mathematical programming formulation of the manufacturing cell formation problem introduced by Nagi et al. The formulation incorporates critical production planning issues that include long-term projected production requirements, resource capacity constraints, functionally identical machines and alternative process plans in the cell formation problem, with a common objective of minimizing the resulting inter-cell material handling effort. This problem is NP-hard. The previous work presented a heuristic solution based on decomposing the integrated problem into capacitated route selection and cell formation sub-problems that are solved iteratively until convergence. Like all fast heuristics, the method may suffer from poor solution quality, and non-heuristic methods cannot address problems of typical industrial dimensions because they would require exorbitant amounts of computing time. To overcome both these deficiencies, this paper (i) presents a 0-1 Mixed Integer Linear Programming (MILP) formulation alternative to the integrated cell formation problem, (ii) based on this formulation, develops a branch-and- bound procedure that provides improved solutions compared to those obtained by the heuristic of Nagi et al. (1990), and (iii) makes possible derivation of lower bounds to assess the quality gap when optimal solutions are unavailable or require excessive computing time. This work is important because it allows for better solutions to realistic industrial-sized problem instances. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Vishwanath Ramabhatta & Rakesh Nagi, 1998. "An integrated formulation of manufacturing cell formation with capacity planning and multiple routings," Annals of Operations Research, Springer, vol. 77(0), pages 79-95, January.
    • Handle: RePEc:spr:annopr:v:77:y:1998:i:0:p:79-95:10.1023/a:1018933613215
    DOI: 10.1023/A:1018933613215
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018933613215
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018933613215?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. M Diaby & A L Nsakanda, 2006. "Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1100-1112, September.
    2. Shruti Shashikumar & Rakesh D. Raut & Vaibhav S. Narwane & Bhaskar B. Gardas & Balkrishna E. Narkhede & Anjali Awasthi, 2019. "A novel approach to determine the cell formation using heuristics approach," OPSEARCH, Springer;Operational Research Society of India, vol. 56(3), pages 628-656, September.
    3. Pourvaziri, Hani & Pierreval, Henri, 2017. "Dynamic facility layout problem based on open queuing network theory," European Journal of Operational Research, Elsevier, vol. 259(2), pages 538-553.
    4. Nsakanda, Aaron Luntala & Diaby, Moustapha & Price, Wilson L., 2006. "Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings," European Journal of Operational Research, Elsevier, vol. 171(3), pages 1051-1070, June.

    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:spr:annopr:v:77:y:1998:i:0:p:79-95:10.1023/a:1018933613215. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.