IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v25y1979i5p466-473.html
   My bibliography  Save this article

Candidate to Job Allocation Problem with a Lexicographic Objective

Author

Listed:
  • J. Cramer

    (Technion-Israel Institute of Technology)

  • M. A. Pollatschek

    (Technion-Israel Institute of Technology)

Abstract

Allocation of candidates to jobs is required in a situation where each candidate can only be allocated to certain jobs, and every job's "length" decreases as more candidates are allocated to it. The objective is to minimize the "ranked length vector," which is derived by arranging the job-lengths in nonincreasing order, in the lexicographic sense. Necessary and sufficient conditions for optimality are derived, and an algorithm for obtaining optimal allocations is presented, along with computational experience.

Suggested Citation

  • J. Cramer & M. A. Pollatschek, 1979. "Candidate to Job Allocation Problem with a Lexicographic Objective," Management Science, INFORMS, vol. 25(5), pages 466-473, May.
    • Handle: RePEc:inm:ormnsc:v:25:y:1979:i:5:p:466-473
    DOI: 10.1287/mnsc.25.5.466
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.25.5.466
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.25.5.466?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Letsios, Dimitrios & Mistry, Miten & Misener, Ruth, 2021. "Exact lexicographic scheduling and approximate rescheduling," European Journal of Operational Research, Elsevier, vol. 290(2), pages 469-478.

    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:ormnsc:v:25:y:1979:i:5:p:466-473. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.