IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v229y2013i1p59-66.html
   My bibliography  Save this article

Competitive strategies for an online generalized assignment problem with a service consecution constraint

Author

Listed:
  • Zheng, Feifeng
  • Cheng, Yongxi
  • Xu, Yinfeng
  • Liu, Ming

Abstract

This work studies a variant of the online generalized assignment problem, where there are m⩾2 heterogeneous servers to process n requests which arrive one by one over time. Each request must either be assigned to one of the servers or be rejected upon its arrival, before knowing any information of future requests. There is a corresponding weight (or revenue) for assigning each request to a server, and the objective is to maximize the total weights obtained from all the requests. We study the above problem with a service consecution constraint, such that at any time each server is only allowed to process up to d consecutive requests.

Suggested Citation

  • Zheng, Feifeng & Cheng, Yongxi & Xu, Yinfeng & Liu, Ming, 2013. "Competitive strategies for an online generalized assignment problem with a service consecution constraint," European Journal of Operational Research, Elsevier, vol. 229(1), pages 59-66.
    • Handle: RePEc:eee:ejores:v:229:y:2013:i:1:p:59-66
    DOI: 10.1016/j.ejor.2013.02.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713001227
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.02.004?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. Arora, Shalini & Puri, M. C., 1998. "A variant of time minimizing assignment problem," European Journal of Operational Research, Elsevier, vol. 110(2), pages 314-325, October.
    2. G. Terry Ross & Richard M. Soland, 1977. "Modeling Facility Location Problems as Generalized Assignment Problems," Management Science, INFORMS, vol. 24(3), pages 345-357, November.
    3. Irnich, Stefan, 2010. "A new branch-and-price algorithm for the traveling tournament problem," European Journal of Operational Research, Elsevier, vol. 204(2), pages 218-228, July.
    4. Martello, Silvano & Toth, Paolo, 1995. "The bottleneck generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 83(3), pages 621-638, June.
    5. Cattrysse, Dirk G. & Van Wassenhove, Luk N., 1992. "A survey of algorithms for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 60(3), pages 260-272, August.
    6. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    7. Campbell, Gerard M. & Diaby, Moustapha, 2002. "Development and evaluation of an assignment heuristic for allocating cross-trained workers," European Journal of Operational Research, Elsevier, vol. 138(1), pages 9-20, April.
    8. Gschwind, Timo & Irnich, Stefan, 2011. "A note on symmetry reduction for circular traveling tournament problems," European Journal of Operational Research, Elsevier, vol. 210(2), pages 452-456, April.
    9. Aneja, Y. P. & Punnen, A. P., 1999. "Multiple bottleneck assignment problem," European Journal of Operational Research, Elsevier, vol. 112(1), pages 167-173, January.
    10. Rasmussen, Rasmus V. & Trick, Michael A., 2008. "Round robin scheduling - a survey," European Journal of Operational Research, Elsevier, vol. 188(3), pages 617-636, August.
    11. Sun, Kaibiao & Li, Hongxing, 2010. "Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines," International Journal of Production Economics, Elsevier, vol. 124(1), pages 151-158, March.
    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. Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang, 0. "Online economic ordering problem for deteriorating items with limited price information," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-23.
    2. Dai, Wenqiang & Dong, Yucheng & Zhang, Xiaotian, 2016. "Competitive analysis of the online financial lease problem," European Journal of Operational Research, Elsevier, vol. 250(3), pages 865-873.
    3. Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang, 2022. "Online economic ordering problem for deteriorating items with limited price information," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2246-2268, 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. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    2. Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.
    3. Matusiak, M. & de Koster, M.B.M. & Saarinen, J., 2015. "Data-driven warehouse optimization," ERIM Report Series Research in Management ERS-2015-008-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    4. Matusiak, Marek & de Koster, René & Saarinen, Jari, 2017. "Utilizing individual picker skills to improve order batching in a warehouse," European Journal of Operational Research, Elsevier, vol. 263(3), pages 888-899.
    5. Özlem Karsu & Meral Azizoğlu, 2014. "Bicriteria multiresource generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(8), pages 621-636, December.
    6. Hoshino, Richard & Kawarabayashi, Ken-ichi, 2011. "A multi-round generalization of the traveling tournament problem and its application to Japanese baseball," European Journal of Operational Research, Elsevier, vol. 215(2), pages 481-497, December.
    7. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
    8. Alireza Tajbakhsh & Kourosh Eshghi & Azam Shamsi, 2012. "A hybrid PSO-SA algorithm for the travelling tournament problem," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(1), pages 2-25.
    9. Boccia, Maurizio & Masone, Adriano & Sterle, Claudio & Murino, Teresa, 2023. "The parallel AGV scheduling problem with battery constraints: A new formulation and a matheuristic approach," European Journal of Operational Research, Elsevier, vol. 307(2), pages 590-603.
    10. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.
    11. Albareda-Sambola, Maria & Vlerk, Maarten H. van der & Fernandez, Elena, 2002. "Exact solutions to a class of stochastic generalized assignment problems," Research Report 02A11, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    12. Ahmed Ghoniem & Tulay Flamand & Mohamed Haouari, 2016. "Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 575-588, August.
    13. repec:dgr:rugsom:02a11 is not listed on IDEAS
    14. M. Gaudioso & L. Moccia & M. F. Monaco, 2010. "Repulsive Assignment Problem," Journal of Optimization Theory and Applications, Springer, vol. 144(2), pages 255-273, February.
    15. Haddadi, Salim & Ouzia, Hacene, 2004. "Effective algorithm and heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 153(1), pages 184-190, February.
    16. Ahmed Ghoniem & Tulay Flamand & Mohamed Haouari, 2016. "Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 589-602, August.
    17. Sana Bouajaja & Najoua Dridi, 2017. "A survey on human resource allocation problem and its applications," Operational Research, Springer, vol. 17(2), pages 339-369, July.
    18. Flavia Bonomo & Andrés Cardemil & Guillermo Durán & Javier Marenco & Daniela Sabán, 2012. "An Application of the Traveling Tournament Problem: The Argentine Volleyball League," Interfaces, INFORMS, vol. 42(3), pages 245-259, June.
    19. Franck Butelle & Laurent Alfandari & Camille Coti & Lucian Finta & Lucas Létocart & Gérard Plateau & Frédéric Roupin & Antoine Rozenknop & Roberto Wolfler Calvo, 2016. "Fast machine reassignment," Annals of Operations Research, Springer, vol. 242(1), pages 133-160, July.
    20. Liles, Joseph M. & Robbins, Matthew J. & Lunday, Brian J., 2023. "Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1435-1449.
    21. Holzapfel, Andreas & Kuhn, Heinrich & Sternbeck, Michael G., 2018. "Product allocation to different types of distribution center in retail logistics networks," European Journal of Operational Research, Elsevier, vol. 264(3), pages 948-966.

    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:eee:ejores:v:229:y:2013:i:1:p:59-66. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.