IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v125y2005i3d10.1007_s10957-005-2094-2.html
   My bibliography  Save this article

Optimal Release Times in Single-Stage Manufacturing Systems with Blocking: Optimal Control Perspective

Author

Listed:
  • J. Moon

    (Samsung Electronics)

  • Y. Wardi

    (Georgia Institute of Technology)

Abstract

This paper concerns a due-date matching problem in a single-stage manufacturing system. Given a finite sequence of jobs and their service order, and given the delivery due date of each job, the problem is to choose the jobs release (arrival) times so as to match as closely as possible their completion times to their respective due dates. The system is modelled as a deterministic single-server FIFO queue with an output buffer for storing jobs whose service is completed prior to their due dates. The output buffer has a finite capacity; when it is full, the server is being blocked. Associated with each job there is a convex cost function penalizing its earliness as well as tardiness. The due-date matching problem is cast as an optimal control problem, whose objective is to minimize the sum of the above cost functions by the choice of the jobs arrival (release) times. Time-box upper-bound and lower-bound constraints are imposed on the jobs output (delivery) times. The optimal-control setting brings to bear on the development of fast and efficient algorithms having intuitive geometric appeal and potential for online implementation.

Suggested Citation

  • J. Moon & Y. Wardi, 2005. "Optimal Release Times in Single-Stage Manufacturing Systems with Blocking: Optimal Control Perspective," Journal of Optimization Theory and Applications, Springer, vol. 125(3), pages 653-672, June.
    • Handle: RePEc:spr:joptap:v:125:y:2005:i:3:d:10.1007_s10957-005-2094-2
    DOI: 10.1007/s10957-005-2094-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-005-2094-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-005-2094-2?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:spr:joptap:v:125:y:2005:i:3:d:10.1007_s10957-005-2094-2. 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.