Disjunctive Graph Representation

Disjunctive Graph Representation is a directed graph model in job shop scheduling where nodes represent operations, arcs represent precedence constraints between operations of the same job, and disjunctive edges represent pairwise, mutually exclusive processing orders between operations sharing the same machine, thereby encoding feasible schedules through consistent orientation of these edges.

69

Publications

4K

Citations

171

Authors

96

Institutions

Publications per year

2017–2026

25

Authors

171

  1. SD
    Stéphane Dauzère‐Pérès

    Mines Saint-Étienne, France

    4 publications · 135 citations

    4

    h-index

  2. EB
    Egon Balas

    Carnegie Mellon University, United States

    4 publications · 672 citations

    4

    h-index

  3. JT
    Jiafu Tang

    Northeastern University, China

    3 publications · 68 citations

    3

    h-index

  4. LM
    Lars Mönch

    FernUniversität in Hagen, Germany

    3 publications · 70 citations

    3

    h-index

  5. ZF
    Zhi‐Ping Fan

    Northeastern University, China

    3 publications · 68 citations

    3

    h-index

1–5 of 171

Venues

  1. International Journal of Production Research

    9 publications · 359 citations

    9

    h-index

  2. Operations Research

    4 publications · 711 citations

    4

    h-index

  3. IEEE Transactions on Industrial Informatics

    3 publications · 244 citations

    3

    h-index

  4. IEEE Access

    2 publications · 248 citations

    2

    h-index

  5. Journal of Combinatorial Optimization

    2 publications · 44 citations

    2

    h-index

1–5