IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v91y1999i0p49-6210.1023-a1018966227095.html
   My bibliography  Save this article

Optimal control of assembling complexes underpredetermined maintenance conditions

Author

Listed:
  • K. Kogan
  • E. Levner

Abstract

This paper discusses a continuous‐time approach to production control of parallel assemblingcomplexes under maintenance activities specified in advance in order to avoidmachine failures along the planning horizon. Every complex includes multiple machinesand a tandem storage and retrieval station. Each machine performs a number of assemblingoperations with negligible setups and controllable production rates subject to time windowsin which predetermined maintenance actions are to be carried out. The objective is to controlsimultaneous assembling of different items in every complex in order to track dynamicdemands for the items as closely as possible, without exceeding the capacity of the tandemstorage and retrieval stations. With the aid of the maximum principle, optimal productionregimes are derived and a fast iterative time‐decomposition algorithm is developed to locatethose regimes along the planning horizon with a given accuracy. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • K. Kogan & E. Levner, 1999. "Optimal control of assembling complexes underpredetermined maintenance conditions," Annals of Operations Research, Springer, vol. 91(0), pages 49-62, January.
    • Handle: RePEc:spr:annopr:v:91:y:1999:i:0:p:49-62:10.1023/a:1018966227095
    DOI: 10.1023/A:1018966227095
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018966227095
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018966227095?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.

    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:spr:annopr:v:91:y:1999:i:0:p:49-62:10.1023/a:1018966227095. 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.