IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v6y2009i3p405-419.html
   My bibliography  Save this article

Scheduling with undirected graphs: motivations and reviews

Author

Listed:
  • Mourad Boudhar

Abstract

In this paper, we aim at compiling the bibliography and the recent developments on scheduling problems involving undirected graphs. Two types of problems are considered: the mutual exclusion scheduling and the scheduling with batch-compatible jobs. We first consider the scheduling problems that can be solved by creating an undirected graph with a vertex for each job and an edge between every pair of conflicting jobs. Then, we consider the problem of minimising the makespan on a batch processing machine in which jobs are not at all compatible. This relation of compatibility is represented by an undirected graph called 'compatibility graph'.

Suggested Citation

  • Mourad Boudhar, 2009. "Scheduling with undirected graphs: motivations and reviews," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 6(3), pages 405-419.
    • Handle: RePEc:ids:ijores:v:6:y:2009:i:3:p:405-419
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=26940
    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.

    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:ids:ijores:v:6:y:2009:i:3:p:405-419. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.