IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v11y2000i05ns012918310000081x.html
   My bibliography  Save this article

Optimization Of Production Planning Problems — A Case Study For Assembly Lines

Author

Listed:
  • JOHANNES SCHNEIDER

    (Fakultät Physik, Universität Regensburg, D-93040 Regensburg, Germany;
    Physik-Institut, Universität Zürich-Irchel, Winterthurerstr. 190, CH-8057 Zürich, Switzerland)

  • JÜRGEN BRITZE

    (BMW AG, Abteilung TI 15, Helene-Mayer-Ring 4, D-80788 München, Germany)

  • ANJA EBERSBACH

    (Lehrstuhl für Informationswissenschaft, Universität Regensburg, D-93040 Regensburg, Germany)

  • INGO MORGENSTERN

    (Fakultät Physik, Universität Regensburg, D-93040 Regensburg, Germany)

  • MARKUS PUCHTA

    (Fakultät Physik, Universität Regensburg, D-93040 Regensburg, Germany)

Abstract

For a few years, Simulated Annealing (SA)1and related Monte Carlo optimization algorithms like Threshold Accepting (TA)2have become a useful means for optimizing various kinds of economic problems, like the Traveling Salesman Problem (TSP). In this paper, we concentrate on the production processes themselves because most costs are thereby incurred, such that a small relative improvement can lead to large savings. We will present an application of these physical optimization algorithms for a certain type of assembly lines which can be transferred to a TSP with additional constraints.

Suggested Citation

  • Johannes Schneider & Jürgen Britze & Anja Ebersbach & Ingo Morgenstern & Markus Puchta, 2000. "Optimization Of Production Planning Problems — A Case Study For Assembly Lines," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 11(05), pages 949-972.
    • Handle: RePEc:wsi:ijmpcx:v:11:y:2000:i:05:n:s012918310000081x
    DOI: 10.1142/S012918310000081X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S012918310000081X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S012918310000081X?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.

    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:wsi:ijmpcx:v:11:y:2000:i:05:n:s012918310000081x. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.