IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v55y2008i3p234-251.html
   My bibliography  Save this article

Dynamic server assignment policies for assembly‐type queues with flexible servers

Author

Listed:
  • Yi‐Chun Tsai
  • Nilay Tanık Argon

Abstract

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

Suggested Citation

  • Yi‐Chun Tsai & Nilay Tanık Argon, 2008. "Dynamic server assignment policies for assembly‐type queues with flexible servers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(3), pages 234-251, April.
    • Handle: RePEc:wly:navres:v:55:y:2008:i:3:p:234-251
    DOI: 10.1002/nav.20281
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20281
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20281?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
    ---><---

    References listed on IDEAS

    as
    1. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2003. "Dynamic Server Allocation for Queueing Networks with Flexible Servers," Operations Research, INFORMS, vol. 51(6), pages 952-968, December.
    2. Frederick S. Hillier & Kut C. So & Ronald W. Boling, 1993. "Notes: Toward Characterizing the Optimal Allocation of Storage Space in Production Line Systems with Variable Processing Times," Management Science, INFORMS, vol. 39(1), pages 126-133, January.
    3. Izak Duenyas & Diwakar Gupta & Tava Lennon Olsen, 1998. "Control of a Single-Server Tandem Queueing System with Setups," Operations Research, INFORMS, vol. 46(2), pages 218-230, April.
    4. Liu, Liming & Yuan, Xue-Ming, 2001. "Throughput, flow times, and service level in an unreliable assembly system," European Journal of Operational Research, Elsevier, vol. 135(3), pages 602-615, December.
    5. Yuan, Xue-Ming & Liu, Liming, 2005. "Performance analysis of assembly systems with unreliable machines and finite buffers," European Journal of Operational Research, Elsevier, vol. 161(3), pages 854-871, March.
    6. Sigrún Andradóttir & Hayriye Ayhan, 2005. "Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers," Operations Research, INFORMS, vol. 53(3), pages 516-531, June.
    7. N. Asadathorn & X. Chao, 1999. "A decomposition approximation for assembly‐disassembly queueing networkswith finite buffer and blocking," Annals of Operations Research, Springer, vol. 87(0), pages 247-261, April.
    8. John J. Bartholdi & Donald D. Eisenstein, 1996. "A Production Line that Balances Itself," Operations Research, INFORMS, vol. 44(1), pages 21-34, February.
    9. John J. Bartholdi & Donald D. Eisenstein & Robert D. Foley, 2001. "Performance of Bucket Brigades When Work Is Stochastic," Operations Research, INFORMS, vol. 49(5), pages 710-719, October.
    10. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2001. "Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems," Management Science, INFORMS, vol. 47(10), pages 1421-1439, October.
    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. E. Morozov & B. Steyaert, 2013. "Stability analysis of a two-station cascade queueing network," Annals of Operations Research, Springer, vol. 202(1), pages 135-160, January.
    2. Eugene Furman & Adam Diamant & Murat Kristal, 2021. "Customer Acquisition and Retention: A Fluid Approach for Staffing," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4236-4257, November.

    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. Eser Kırkızlar & Sigrún Andradóttir & Hayriye Ayhan, 2010. "Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(6), pages 563-582, September.
    2. Peng Wang & Kai Pan & Zhenzhen Yan & Yun Fong Lim, 2022. "Managing Stochastic Bucket Brigades on Discrete Work Stations," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 358-373, January.
    3. Eser Kırkızlar & Sigrún Andradóttir & Hayriye Ayhan, 2012. "Flexible Servers in Understaffed Tandem Lines," Production and Operations Management, Production and Operations Management Society, vol. 21(4), pages 761-777, July.
    4. Yun Fong Lim & Bingnan Lu & Rowan Wang & Wenjia Zhang, 2020. "Flexibly Serving A Finite Number of Heterogeneous Jobs in A Tandem System," Production and Operations Management, Production and Operations Management Society, vol. 29(6), pages 1431-1447, June.
    5. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2007. "Compensating for Failures with Flexible Servers," Operations Research, INFORMS, vol. 55(4), pages 753-768, August.
    6. S.M.R. Iravani & J.A. Buzacott & M.J.M. Posner, 2005. "A robust policy for serial agile production systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 58-73, February.
    7. Nilay Tanık Argon & Sigrún Andradóttir, 2017. "Pooling in tandem queueing networks with non-collaborative servers," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 345-377, December.
    8. Tuğçe Işık & Sigrún Andradóttir & Hayriye Ayhan, 2016. "Optimal control of queueing systems with non-collaborating servers," Queueing Systems: Theory and Applications, Springer, vol. 84(1), pages 79-110, October.
    9. Sennott, Linn I. & Van Oyen, Mark P. & Iravani, Seyed M.R., 2006. "Optimal dynamic assignment of a flexible worker on an open production line with specialists," European Journal of Operational Research, Elsevier, vol. 170(2), pages 541-566, April.
    10. Sigrún Andradóttir & Hayriye Ayhan, 2005. "Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers," Operations Research, INFORMS, vol. 53(3), pages 516-531, June.
    11. Gregory Dobson & Tolga Tezcan & Vera Tilson, 2013. "Optimal Workflow Decisions for Investigators in Systems with Interruptions," Management Science, INFORMS, vol. 59(5), pages 1125-1141, May.
    12. Seyed M. Iravani & Mark P. Van Oyen & Katharine T. Sims, 2005. "Structural Flexibility: A New Perspective on the Design of Manufacturing and Service Operations," Management Science, INFORMS, vol. 51(2), pages 151-166, February.
    13. Wallace J. Hopp & Seyed M.R. Iravani & Biying Shou & Robert Lien, 2009. "Design and control of agile automated CONWIP production lines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(1), pages 42-56, February.
    14. Gabriel Zayas-Cabán & Jingui Xie & Linda V. Green & Mark E. Lewis, 2016. "Dynamic control of a tandem system with abandonments," Queueing Systems: Theory and Applications, Springer, vol. 84(3), pages 279-293, December.
    15. Aili (Alice) Zou & Douglas G. Down, 2018. "Asymptotically Maximal Throughput in Tandem Systems with Flexible and Dedicated Servers," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-15, October.
    16. Ramesh Arumugam & Maria Mayorga & Kevin Taaffe, 2009. "Inventory based allocation policies for flexible servers in serial systems," Annals of Operations Research, Springer, vol. 172(1), pages 1-23, November.
    17. Tuğçe Işık & Sigrún Andradóttir & Hayriye Ayhan, 2022. "Dynamic Control of Non‐Collaborative Workers When Reassignment Is Costly," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1332-1352, March.
    18. Gregory Dobson & Hsiao-Hui Lee & Arvind Sainathan & Vera Tilson, 2012. "A Queueing Model to Evaluate the Impact of Patient "Batching" on Throughput and Flow Time in a Medical Teaching Facility," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 584-599, October.
    19. Down, Douglas G. & Karakostas, George, 2008. "Maximizing throughput in queueing networks with limited flexibility," European Journal of Operational Research, Elsevier, vol. 187(1), pages 98-112, May.
    20. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2001. "Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems," Management Science, INFORMS, vol. 47(10), pages 1421-1439, October.

    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:wly:navres:v:55:y:2008:i:3:p:234-251. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.