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

Bicriteria multiresource generalized assignment problem

Author

Listed:
  • Özlem Karsu
  • Meral Azizoğlu

Abstract

In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621–636, 2014

Suggested Citation

  • Ö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.
    • Handle: RePEc:wly:navres:v:61:y:2014:i:8:p:621-636
    DOI: 10.1002/nav.21607
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21607
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21607?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. 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.
    2. Martello, Silvano & Toth, Paolo, 1995. "A note on exact algorithms for the bottleneck generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 83(3), pages 711-712, June.
    3. Punnen, Abraham P. & Aneja, Y. P., 1995. "Minmax combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 81(3), pages 634-643, March.
    4. Mazzola, J. B. & Neebe, A. W., 1988. "Bottleneck generalized assignment problems," Engineering Costs and Production Economics, Elsevier, vol. 14(1), pages 61-65, May.
    5. Pirkul, Hasan, 1986. "An integer programming model for the allocation of databases in a distributed computer system," European Journal of Operational Research, Elsevier, vol. 26(3), pages 401-411, September.
    6. Martello, Silvano & Toth, Paolo, 1995. "The bottleneck generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 83(3), pages 621-638, June.
    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.
    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. Monnerat, Filipe & Dias, Joana & Alves, Maria João, 2019. "Fleet management: A vehicle and driver assignment model," European Journal of Operational Research, Elsevier, vol. 278(1), pages 64-75.
    2. Prabhjot Kaur & Kalpana Dahiya & Vanita Verma, 2021. "Time-cost trade-off analysis of a priority based assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 448-482, June.

    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. Joseph B. Mazzola & Alan W. Neebe, 2012. "A generalized assignment model for dynamic supply chain capacity planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(6), pages 470-485, September.
    3. 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.
    4. Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.
    5. Yelin Fu & Jianshan Sun & K. Lai & John Leung, 2015. "A robust optimization solution to bottleneck generalized assignment problem under uncertainty," Annals of Operations Research, Springer, vol. 233(1), pages 123-133, October.
    6. 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.
    7. Sonia & Puri, M.C., 2008. "Two-stage time minimizing assignment problem," Omega, Elsevier, vol. 36(5), pages 730-740, October.
    8. Martello, Silvano & Toth, Paolo, 1995. "The bottleneck generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 83(3), pages 621-638, June.
    9. 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.
    10. Joseph B. Mazzola & Steven P. Wilcox, 2001. "Heuristics for the multi‐resource generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 468-483, September.
    11. E L Hillsman, 1984. "The p-Median Structure as a Unified Linear Model for Location—Allocation Analysis," Environment and Planning A, , vol. 16(3), pages 305-318, March.
    12. Sayin, Serpil & Karabati, Selcuk, 2007. "Assigning cross-trained workers to departments: A two-stage optimization model to maximize utility and skill improvement," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1643-1658, February.
    13. Jonathan F. Bard & Lin Wan, 2008. "Workforce Design with Movement Restrictions Between Workstation Groups," Manufacturing & Service Operations Management, INFORMS, vol. 10(1), pages 24-42, November.
    14. Fowler, John W. & Wirojanagud, Pornsarun & Gel, Esma S., 2008. "Heuristics for workforce planning with worker differences," European Journal of Operational Research, Elsevier, vol. 190(3), pages 724-740, November.
    15. Corominas, Albert & Lusa, Amaia & Pastor, Rafael, 2007. "Using a MILP model to establish a framework for an annualised hours agreement," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1495-1506, March.
    16. Ladier, Anne-Laure & Alpan, Gülgün & Penz, Bernard, 2014. "Joint employee weekly timetabling and daily rostering: A decision-support tool for a logistics platform," European Journal of Operational Research, Elsevier, vol. 234(1), pages 278-291.
    17. G M Campbell, 2011. "A two-stage stochastic program for scheduling and allocating cross-trained workers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 1038-1047, June.
    18. LeBlanc, Larry J. & Shtub, Avraham & Anandalingam, G., 1999. "Formulating and solving production planning problems," European Journal of Operational Research, Elsevier, vol. 112(1), pages 54-80, January.
    19. J Malczewski & W Ogryczak, 1995. "The Multiple Criteria Location Problem: 1. A Generalized Network Model and the Set of Efficient Solutions," Environment and Planning A, , vol. 27(12), pages 1931-1960, December.
    20. Maciej Drwal & Jerzy Jozefczyk, 2014. "Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding," Annals of Operations Research, Springer, vol. 222(1), pages 261-277, November.

    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:61:y:2014:i:8:p:621-636. 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.