@article {IOPORT.05622360,
    author       = {Boudhar, Mourad},
    title        = {Scheduling with undirected graphs: motivations and reviews.},
    year         = {2009},
    journal      = {International Journal of Operational Research},
    volume       = {6},
    number       = {3},
    issn         = {1745-7645},
    pages        = {405-419},
    publisher    = {Inderscience Enterprises, Gen\`eve},
    doi          = {10.1504/IJOR.2009.026940},
    abstract     = {Summary: 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'.},
    identifier   = {05622360},
}