IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v47y2015i6p620-633.html
   My bibliography  Save this article

Forming competitively balanced teams

Author

Listed:
  • Paul A. Rubin
  • Lihui Bai

Abstract

This article examines the problem of assigning individuals to teams to make the teams as similar as possible to each other across multiple attributes. This may be complicated by a variety of constraints, including restrictions on whether specific individuals can or should be assigned to the same team. The problem arises in multiple contexts, including youth recreation leagues and academic programs or courses with mandated project groups. A model for the problem is proposed and various solution approaches are investigated, including mixed-integer programming and several heuristics. Supplementary materials are available for this article. Go to the publisher’s online edition of IIE Transactions for datasets, additional tables, detailed proofs, etc.

Suggested Citation

  • Paul A. Rubin & Lihui Bai, 2015. "Forming competitively balanced teams," IISE Transactions, Taylor & Francis Journals, vol. 47(6), pages 620-633, June.
    • Handle: RePEc:taf:uiiexx:v:47:y:2015:i:6:p:620-633
    DOI: 10.1080/0740817X.2014.953643
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2014.953643
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2014.953643?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.

    Citations

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


    Cited by:

    1. Schulz, Arne, 2021. "The balanced maximally diverse grouping problem with block constraints," European Journal of Operational Research, Elsevier, vol. 294(1), pages 42-53.
    2. Arne Schulz, 2022. "A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values," Annals of Operations Research, Springer, vol. 318(1), pages 501-530, 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:taf:uiiexx:v:47:y:2015:i:6:p:620-633. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.