Jump to content

Disjunctive graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Qx2020 (talk | contribs) at 17:43, 9 September 2012 (→References). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A Disjunctive Graph is a special graph structure, frequently used in Job Shop scheduling (kind of) problems.[1]


References

  1. ^ http://www.idp.zhaw.ch/fileadmin/user_upload/engineering/_Institute_und_Zentren/IDP/pdfs/Publikationen/klinkert_ecco_2002.pdf

2. S. ROY AND B. SUSSMAN, "Les problemes d'ordonnancement avec contraintes disjonctives," SEMA, Note D.S. No. 9 bis (decembre 1964)

3. E. BALAS, "Machine Sequencing: Disjunctive Graphs and Degree-Constrained Subgraphs," IBM, New York Scientific Center Report No. 320-2971 (April 1969).

Retrieved from "https://en.wikipedia.org/w/index.php?title=Disjunctive_graph&oldid=511565538"