IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v172y2009i1p231-24210.1007-s10479-009-0575-7.html
   My bibliography  Save this article

Allocating flexible servers in serial systems with switching costs

Author

Listed:
  • Maria Mayorga
  • Kevin Taaffe
  • Ramesh Arumugam

Abstract

Consider a firm that operates a make-to-order serial production system and employs a cross-trained workforce. We model such a firm as a tandem queuing system in which flexible servers can be allocated across stations, and assume that a switching cost is charged when servers move between stations. We show that even in the two-station two-server case the optimal policy follows a complex state-dependent structure that may be difficult to implement in practice. We propose three alternate heuristic policies and assess their performance. We show that a simpler policy which only moves one server can achieve close to optimal results. Copyright Springer Science+Business Media, LLC 2009

Suggested Citation

  • Maria Mayorga & Kevin Taaffe & Ramesh Arumugam, 2009. "Allocating flexible servers in serial systems with switching costs," Annals of Operations Research, Springer, vol. 172(1), pages 231-242, November.
    • Handle: RePEc:spr:annopr:v:172:y:2009:i:1:p:231-242:10.1007/s10479-009-0575-7
    DOI: 10.1007/s10479-009-0575-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-009-0575-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-009-0575-7?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. Seyed M. R. Iravani & John A. Buzacott & Morton J. M. Posner, 2003. "Operations and Shipment Scheduling of a Batch on a Felxible Machine," Operations Research, INFORMS, vol. 51(4), pages 585-601, August.
    2. Batta, Rajan & Berman, Oded & Wang, Qian, 2007. "Balancing staffing and switching costs in a service center with flexible servers," European Journal of Operational Research, Elsevier, vol. 177(2), pages 924-938, March.
    3. M. Yu. Kitaev & Richard F. Serfozo, 1999. "M/M/1 Queues with Switching Costs and Hysteretic Optimal Control," Operations Research, INFORMS, vol. 47(2), pages 310-312, April.
    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. Maria E. Mayorga & Emmett J. Lodree & Justin Wolczynski, 2017. "The optimal assignment of spontaneous volunteers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 1106-1116, September.
    2. Nha-Nghi Cruz & Hans Daduna, 2019. "Optimal capacity allocation in a production–inventory system with base stock," Annals of Operations Research, Springer, vol. 277(2), pages 329-344, June.
    3. 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.
    4. Emmett J. Lodree & Nezih Altay & Robert A. Cook, 2019. "Staff assignment policies for a mass casualty event queuing network," Annals of Operations Research, Springer, vol. 283(1), pages 411-442, December.
    5. 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.

    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. 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.
    2. Terekhov, Daria & Christopher Beck, J., 2009. "An extended queueing control model for facilities with front room and back room operations and mixed-skilled workers," European Journal of Operational Research, Elsevier, vol. 198(1), pages 223-231, October.
    3. O. Boxma & A. Löpker & D. Perry, 2016. "On a make-to-stock production/mountain modeln with hysteretic control," Annals of Operations Research, Springer, vol. 241(1), pages 53-82, June.
    4. Henao, César Augusto & Ferrer, Juan Carlos & Muñoz, Juan Carlos & Vera, Jorge, 2016. "Multiskilling with closed chains in a service industry: A robust optimization approach," International Journal of Production Economics, Elsevier, vol. 179(C), pages 166-178.
    5. Jingui Xie & Yiming Fan & Mabel C. Chou, 2017. "Flexibility design in loss and queueing systems: efficiency of k-chain configuration," Flexible Services and Manufacturing Journal, Springer, vol. 29(2), pages 286-308, June.
    6. 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.
    7. Gnanlet, Adelina & Gilland, Wendell G., 2014. "Impact of productivity on cross-training configurations and optimal staffing decisions in hospitals," European Journal of Operational Research, Elsevier, vol. 238(1), pages 254-269.
    8. Brusco, Michael J., 2015. "A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives," European Journal of Operational Research, Elsevier, vol. 247(1), pages 46-59.
    9. De Bruecker, Philippe & Van den Bergh, Jorne & Beliën, Jeroen & Demeulemeester, Erik, 2015. "Workforce planning incorporating skills: State of the art," European Journal of Operational Research, Elsevier, vol. 243(1), pages 1-16.
    10. Aktekin, Tevfik, 2014. "Call center service process analysis: Bayesian parametric and semi-parametric mixture modeling," European Journal of Operational Research, Elsevier, vol. 234(3), pages 709-719.
    11. Lingjiao Zhang & Jinting Wang & Yilin Wang, 2023. "Strategic Behavior and Optimization of an M/M/1 Queue with N-Policy and Hysteretic Control," Methodology and Computing in Applied Probability, Springer, vol. 25(4), pages 1-29, December.
    12. Olivella, Jordi & Nembhard, David, 2016. "Calibrating cross-training to meet demand mix variation and employee absence," European Journal of Operational Research, Elsevier, vol. 248(2), pages 462-472.
    13. Batta, Rajan & Berman, Oded & Wang, Qian, 2007. "Balancing staffing and switching costs in a service center with flexible servers," European Journal of Operational Research, Elsevier, vol. 177(2), pages 924-938, March.
    14. Daria Terekhov & J. Christopher Beck & Kenneth N. Brown, 2009. "A Constraint Programming Approach for Solving a Queueing Design and Control Problem," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 549-561, November.
    15. J. R. Artalejo & A. Economou, 2005. "Markovian Controllable Queueing Systems with Hysteretic Policies: Busy Period and Waiting Time Analysis," Methodology and Computing in Applied Probability, Springer, vol. 7(3), pages 353-378, September.
    16. Özlük, Özgür & Elimam, Abdelghani A. & Interaminense, Eduardo, 2010. "Optimum service capacity and demand management with price incentives," European Journal of Operational Research, Elsevier, vol. 204(2), pages 316-327, July.

    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:172:y:2009:i:1:p:231-242:10.1007/s10479-009-0575-7. 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.