IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v56y2008i2p519-522.html
   My bibliography  Save this article

Technical Note---A Note on Parametric Analysis in Linear Assignment

Author

Listed:
  • A. Volgenant

    (Operations Research Group, Faculty of Economics and Econometrics, University of Amsterdam, 1018 WB Amsterdam, The Netherlands)

Abstract

A classic application of the linear assignment problem is the assignment of people to jobs (or jobs to people). In this context, it is interesting to measure competition for jobs and to generate a suitable list of jobs from which a person can choose; the length of the list is a parameter. A known list-generation procedure is based on an interior-point method followed by a parametric analysis. We describe a more efficient procedure, exploiting linear assignment theory and shortest-path computations. Further, we propose an alternative list-generation procedure, based on a special type of dual values for the linear assignment problem.

Suggested Citation

  • A. Volgenant, 2008. "Technical Note---A Note on Parametric Analysis in Linear Assignment," Operations Research, INFORMS, vol. 56(2), pages 519-522, April.
    • Handle: RePEc:inm:oropre:v:56:y:2008:i:2:p:519-522
    DOI: 10.1287/opre.1070.0470
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1070.0470
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1070.0470?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. Allen Holder, 2005. "Navy Personnel Planning and the Optimal Partition," Operations Research, INFORMS, vol. 53(1), pages 77-89, February.
    2. Kindervater, G. & Volgenant, A. & de Leve, G. & van Gijlswijk, V., 1985. "On dual solutions of the linear assignment problem," European Journal of Operational Research, Elsevier, vol. 19(1), pages 76-81, January.
    Full references (including those not matched with items on IDEAS)

    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. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
    2. Yokoya, Daisuke & Duin, Cees W. & Yamada, Takeo, 2011. "A reduction approach to the repeated assignment problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 185-193, April.
    3. Marcel Turkensteen & Dmitry Malyshev & Boris Goldengorin & Panos M. Pardalos, 2017. "The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems," Journal of Global Optimization, Springer, vol. 68(3), pages 601-622, July.
    4. Volgenant, A., 2006. "An addendum on sensitivity analysis of the optimal assignment," European Journal of Operational Research, Elsevier, vol. 169(1), pages 338-339, February.
    5. Cipriano Santos & Tere Gonzalez & Haitao Li & Kay-Yut Chen & Dirk Beyer & Sundaresh Biligi & Qi Feng & Ravindra Kumar & Shelen Jain & Ranga Ramanujam & Alex Zhang, 2013. "HP Enterprise Services Uses Optimization for Resource Planning," Interfaces, INFORMS, vol. 43(2), pages 152-169, April.
    6. Clotilde Coron, 2021. "Quantifying Human Resource Management: A Literature Review," Post-Print halshs-03212718, HAL.
    7. Volgenant, A., 2002. "Solving some lexicographic multi-objective combinatorial problems," European Journal of Operational Research, Elsevier, vol. 139(3), pages 578-584, June.
    8. Karamalak, Levent & Sabuncuoglu, Ihsan & Ozkil, Altan, 2014. "A mathematical model proposal for cost-effective course planning in large hierarchical organizations," European Journal of Operational Research, Elsevier, vol. 238(2), pages 579-595.

    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:inm:oropre:v:56:y:2008:i:2:p:519-522. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.