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

Assignment problems: A golden anniversary survey

Author

Listed:
  • Pentico, David W.

Abstract

No abstract is available for this item.

Suggested Citation

  • Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:2:p:774-793
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00713-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. de Werra, D., 1985. "An introduction to timetabling," European Journal of Operational Research, Elsevier, vol. 19(2), pages 151-162, February.
    2. Geetha, S. & Vartak, M. N., 1994. "The three-dimensional bottleneck assignment problem with capacity constraints," European Journal of Operational Research, Elsevier, vol. 73(3), pages 562-568, March.
    3. Bianco, Lucio & Bielli, Maurizio & Mingozzi, Aristide & Ricciardelli, Salvatore & Spadoni, Massimo, 1992. "A heuristic procedure for the crew rostering problem," European Journal of Operational Research, Elsevier, vol. 58(2), pages 272-283, April.
    4. Yamada, Takeo & Nasu, Yasushi, 2000. "Heuristic and exact algorithms for the simultaneous assignment problem," European Journal of Operational Research, Elsevier, vol. 123(3), pages 531-542, June.
    5. 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.
    6. Laguna, Manuel & Kelly, James P. & Gonzalez-Velarde, JoseLuis & Glover, Fred, 1995. "Tabu search for the multilevel generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 176-189, April.
    7. 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.
    8. Joseph B. Mazzola & Alan W. Neebe, 1986. "Resource-Constrained Assignment Scheduling," Operations Research, INFORMS, vol. 34(4), pages 560-572, August.
    9. Frederick S. Hillier & Michael M. Connors, 1966. "Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities," Management Science, INFORMS, vol. 13(1), pages 42-57, September.
    10. Carraresi, P. & Gallo, G., 1984. "A multi-level bottleneck assignment approach to the bus drivers' rostering problem," European Journal of Operational Research, Elsevier, vol. 16(2), pages 163-173, May.
    11. Mazzola, J. B. & Neebe, A. W., 1988. "Bottleneck generalized assignment problems," Engineering Costs and Production Economics, Elsevier, vol. 14(1), pages 61-65, May.
    12. 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.
    13. Sang M. Lee & Marc J. Schniederjans, 1983. "A Multicriteria Assignment Problem: A Goal Programming Approach," Interfaces, INFORMS, vol. 13(4), pages 75-81, August.
    14. Burkard, Rainer E., 1984. "Quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 15(3), pages 283-289, March.
    15. Shtub, Avraham & Kogan, Konstantin, 1998. "Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP)," European Journal of Operational Research, Elsevier, vol. 105(1), pages 91-99, February.
    16. Bookbinder, James H. & Reece, Kathleen E., 1988. "Vehicle routing considerations in distribution system design," European Journal of Operational Research, Elsevier, vol. 37(2), pages 204-213, November.
    17. Martello, Silvano & Toth, Paolo, 1995. "The bottleneck generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 83(3), pages 621-638, June.
    18. 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.
    19. Volgenant, A., 2002. "Solving some lexicographic multi-objective combinatorial problems," European Journal of Operational Research, Elsevier, vol. 139(3), pages 578-584, June.
    20. Yufei Yuan & Abraham Mehrez & Amiram Gafni, 1992. "Reducing Bias in a Personnel Assignment Process via Multiplicative Utility Solution," Management Science, INFORMS, vol. 38(2), pages 227-239, February.
    21. Nowakovski, Jorg & Schwarzler, Werner & Triesch, Eberhard, 1999. "Using the generalized assignment problem in scheduling the ROSAT space telescope," European Journal of Operational Research, Elsevier, vol. 112(3), pages 531-541, February.
    22. Gaétan Caron & Pierri Hansen & Brigitte Jaumard, 1999. "The Assignment Problem with Seniority and Job Priority Constraints," Operations Research, INFORMS, vol. 47(3), pages 449-453, June.
    23. Lori S. Franz & Janis L. Miller, 1993. "Scheduling Medical Residents to Rotations: Solving the Large-Scale Multiperiod Staff Assignment Problem," Operations Research, INFORMS, vol. 41(2), pages 269-279, April.
    24. J. Kennington & Z. Wang, 1992. "A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem," Operations Research, INFORMS, vol. 40(1), pages 178-187, February.
    25. 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.
    26. Volgenant, A., 2004. "A note on the assignment problem with seniority and job priority constraints," European Journal of Operational Research, Elsevier, vol. 154(1), pages 330-335, April.
    27. Geetha, S. & Nair, K. P. K., 1993. "A variation of the assignment problem," European Journal of Operational Research, Elsevier, vol. 68(3), pages 422-426, August.
    28. Daskalaki, S. & Birbas, T. & Housos, E., 2004. "An integer programming formulation for a case study in university timetabling," European Journal of Operational Research, Elsevier, vol. 153(1), pages 117-135, February.
    29. Aneja, Y. P. & Punnen, A. P., 1999. "Multiple bottleneck assignment problem," European Journal of Operational Research, Elsevier, vol. 112(1), pages 167-173, January.
    30. Eugene L. Lawler, 1963. "The Quadratic Assignment Problem," Management Science, INFORMS, vol. 9(4), pages 586-599, July.
    31. Zvi Drezner, 2003. "A New Genetic Algorithm for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 320-330, August.
    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. 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.
    2. 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.
    3. Ö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.
    4. 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.
    5. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    6. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    7. Volgenant, A., 2004. "A note on the assignment problem with seniority and job priority constraints," European Journal of Operational Research, Elsevier, vol. 154(1), pages 330-335, April.
    8. Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.
    9. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
    10. 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.
    11. Andreas Kleine & Andreas Dellnitz, 2017. "Allocation of seminar applicants," Journal of Business Economics, Springer, vol. 87(7), pages 927-941, October.
    12. 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.
    13. Kazuhiro Tsuchiya & Sunil Bharitkar & Yoshiyasu Takefuji, 1996. "A neural network approach to facility layout problems," European Journal of Operational Research, Elsevier, vol. 89(3), pages 556-563, March.
    14. Jerzy Grobelny & Rafal Michalski, 2016. "A concept of a flexible approach to the facilities layout problems in logistics systems," WORking papers in Management Science (WORMS) WORMS/16/11, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.
    15. Kim, J. -Y. & Kim, Y. -D., 1995. "Graph theoretic heuristics for unequal-sized facility layout problems," Omega, Elsevier, vol. 23(4), pages 391-401, August.
    16. Tallys H. Yunes & Arnaldo V. Moura & Cid C. de Souza, 2005. "Hybrid Column Generation Approaches for Urban Transit Crew Management Problems," Transportation Science, INFORMS, vol. 39(2), pages 273-288, May.
    17. Vittorio Maniezzo, 1999. "Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 358-369, November.
    18. D. J. White, 1993. "A parametric‐based heuristic program for the quadratic assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(4), pages 553-568, June.
    19. 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.
    20. Ceder, A. & Golany, B. & Tal, O., 2001. "Creating bus timetables with maximal synchronization," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(10), pages 913-928, December.

    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:eee:ejores:v:176:y:2007:i:2:p:774-793. 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.