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
Parents
69
Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning
Cong Zhang, Wen Song, Zhiguang Cao et al. · arXiv (Cornell University) · 2020 · 238 citations · Full text
Temporal planning with mutual exclusion reasoning
David E. Smith, Daniel S. Weld · 1999 · 180 citations
Discrete Programming by the Filter Method
Egon Balas · Operations Research · 1967 · 149 citations
1–5 of 69
171
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 171
96

Huazhong University of Science and Technology
Wuhan, China
4 h-index
17 publications
980 citations
Mines Saint-Étienne
Saint-Etienne, France
4 h-index
10 publications
347 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
8 publications
272 citations

Northeastern University
Shenyang, China
3 h-index
8 publications
194 citations

Dongbei University of Finance and Economics
Dalian, China
3 h-index
5 publications
109 citations
Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes
Aubière, France
3 h-index
5 publications
144 citations
University of Bonn
Bonn, Germany
3 h-index
5 publications
334 citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
2 h-index
5 publications
390 citations
1–8 of 96
9 publications · 359 citations
9
h-index
4 publications · 711 citations
4
h-index
3 publications · 244 citations
3
h-index
2 publications · 248 citations
2
h-index
2 publications · 44 citations
2
h-index
1–5