IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i10p1730-1741.html
   My bibliography  Save this article

Complexity of a one-to-one meeting scheduling problem with two types of actors

Author

Listed:
  • Agnès Le Roux

    (LUNAM Université, École des Mines de Nantes, IRCCyN UMR CNRS 6597, Nantes, France)

  • Odile Bellenguez-Morineau

    (LUNAM Université, École des Mines de Nantes, IRCCyN UMR CNRS 6597, Nantes, France)

  • Christelle Guéret

    (Université d’Angers, LARIS EA 7315, Angers, France)

  • Damien Prot

    (LUNAM Université, École des Mines de Nantes, IRCCyN UMR CNRS 6597, Nantes, France)

Abstract

This article deals with a new scheduling problem that arises in the organization of one-to-one meetings in parallel. We first introduce applications of one-to-one meeting scheduling problems. Then, we give an overview of the relevant complexity results. We then prove several complexity results for different versions of the problem.

Suggested Citation

  • Agnès Le Roux & Odile Bellenguez-Morineau & Christelle Guéret & Damien Prot, 2015. "Complexity of a one-to-one meeting scheduling problem with two types of actors," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(10), pages 1730-1741, October.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:10:p:1730-1741
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n10/pdf/jors2014135a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n10/full/jors2014135a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Braathen, Christian, 2022. "Interview Scheduling: An Integer Programming Approach," Discussion Papers 2022/10, Norwegian School of Economics, Department of Business and Management Science.

    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:pal:jorsoc:v:66:y:2015:i:10:p:1730-1741. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.