IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v98y1998i3d10.1023_a1022632231356.html
   My bibliography  Save this article

Optimal Control of a Stochastic Assembly Production Line

Author

Listed:
  • D. P. Song

    (Zhejiang University)

  • Y. X. Sun

    (Zhejiang University)

  • W. Xing

    (Zhejiang University)

Abstract

The system under consideration comprises n workstations in parallel and one assembly workstation. The workstations are either reliable or unreliable and the product demand is random. The n different type parts are processed first in the parallel workstations and then are joined in the assembly workstation. By minimizing the expected discounted cost, it is shown that the optimal control policy is of the bang–bang type and can be described by a set of switching manifolds. The structural properties of the optimal policy, such as monotonicity and asymptotic behavior, are investigated. These structural properties are very useful to find the optimal policy in large-size systems. Three numerical examples are given to demonstrate the results.

Suggested Citation

  • D. P. Song & Y. X. Sun & W. Xing, 1998. "Optimal Control of a Stochastic Assembly Production Line," Journal of Optimization Theory and Applications, Springer, vol. 98(3), pages 681-700, September.
    • Handle: RePEc:spr:joptap:v:98:y:1998:i:3:d:10.1023_a:1022632231356
    DOI: 10.1023/A:1022632231356
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022632231356
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1022632231356?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.

    References listed on IDEAS

    as
    1. Susan H. Xu & Rhonda Righter & J. George Shanthikumar, 1992. "Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel," Operations Research, INFORMS, vol. 40(6), pages 1126-1138, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Xie, Ying & Song, Dong-Ping, 2018. "Optimal planning for container prestaging, discharging, and loading processes at seaport rail terminals with uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 119(C), pages 88-109.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Keumseok Kang & J. George Shanthikumar & Kemal Altinkemer, 2016. "Postponable Acceptance and Assignment: A Stochastic Dynamic Programming Approach," Manufacturing & Service Operations Management, INFORMS, vol. 18(4), pages 493-508, October.
    2. Heng-Li Liu & Quan-Lin Li, 2023. "Matched Queues with Flexible and Impatient Customers," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-26, March.
    3. Delasay, Mohammad & Kolfal, Bora & Ingolfsson, Armann, 2012. "Maximizing throughput in finite-source parallel queue systems," European Journal of Operational Research, Elsevier, vol. 217(3), pages 554-559.
    4. Elena Fernández & Yolanda Hinojosa & Justo Puerto, 2005. "Filtering Policies in Loss Queuing Network Location Problems," Annals of Operations Research, Springer, vol. 136(1), pages 259-283, April.
    5. Wyean Chan & Ger Koole & Pierre L'Ecuyer, 2014. "Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 544-560, October.
    6. Linn Sennott, 1997. "On computing average cost optimal policies with application to routing to parallel queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 45(1), pages 45-62, February.
    7. Zhang, Zhongju & Daigle, John, 2012. "Analysis of job assignment with batch arrivals among heterogeneous servers," European Journal of Operational Research, Elsevier, vol. 217(1), pages 149-161.
    8. Ari Arapostathis & Guodong Pang, 2018. "Infinite-Horizon Average Optimality of the N-Network in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 838-866, August.

    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:98:y:1998:i:3:d:10.1023_a:1022632231356. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.