IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v39y1991i5p824-835.html
   My bibliography  Save this article

An Operation Partitioning Problem for Automated Assembly System Design

Author

Listed:
  • Reza H. Ahmadi

    (University of California, Los Angeles, California)

  • Christopher S. Tang

    (University of California, Los Angeles, California)

Abstract

This paper presents an operation partitioning problem (OPP) that arises from the design of an automated assembly system. To reduce the traffic flow of the system, the OPP assigns operations to machines so that the total number of movements of jobs between machines is minimized. This problem has applications in flexible manufacturing and VLSI design. In flexible manufacturing, OPP relates to a part grouping problem in which different parts are grouped into families. In VLSI design, this problem is related to a VLSI design problem in which a large circuit is partitioned into layers of small circuits. In this paper, we develop a simulated annealing heuristic that finds a near-optimal solution. Random problems are generated for examining the effectiveness of this heuristic.

Suggested Citation

  • Reza H. Ahmadi & Christopher S. Tang, 1991. "An Operation Partitioning Problem for Automated Assembly System Design," Operations Research, INFORMS, vol. 39(5), pages 824-835, October.
    • Handle: RePEc:inm:oropre:v:39:y:1991:i:5:p:824-835
    DOI: 10.1287/opre.39.5.824
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.39.5.824
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.39.5.824?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
    ---><---

    Citations

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


    Cited by:

    1. John G. Klincewicz & Arvind Rajan, 1994. "Using grasp to solve the component grouping problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(7), pages 893-912, December.
    2. Ahmadi, Reza H. & Matsuo, Hirofumi, 2000. "A mini-line approach for pull production," European Journal of Operational Research, Elsevier, vol. 125(2), pages 340-358, September.
    3. Ah-Pine, Julien, 2022. "Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1069-1078.
    4. Punnen, Abraham P. & Aneja, Y. P., 1995. "Minmax combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 81(3), pages 634-643, March.

    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:inm:oropre:v:39:y:1991:i:5:p:824-835. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.