Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Disjunctive graph
open-in-new
<h2 id="further-reading">Further reading</h2> <ul><li>Balas, Egon (April 1969), <i>Machine Sequencing: Disjunctive Graphs and Degree-Constrained Subgraphs</i>, Report No. 320–2971, IBM, New York Scientific Center.</li> <li>Balas, Egon (1969), "Machine sequencing via disjunctive graphs: An implicit enumeration algorithm", <i>Operations Research</i>, 17: 941–957, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1287%2Fopre.17.6.941">10.1287/opre.17.6.941</a>, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=0250770">0250770</a>.</li> <li>Błażewicz, Jacek; Pesch, Erwin; Sterna, Małgorzata (2000), "The disjunctive graph machine representation of the job shop scheduling problem", <i>European Journal of Operational Research</i>, 127 (2): 317–331, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1016%2FS0377-2217%2899%2900486-5">10.1016/S0377-2217(99)00486-5</a>.</li> <li>Mason, Scott J.; Oey, Kasin (2003), "Scheduling complex job shops using disjunctive graphs: A cycle elimination procedure", <i>International Journal of Production Research</i>, 41 (5): 981–994, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1080%2F00207540210163009">10.1080/00207540210163009</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Gröflin, H.; Klinkert, A. (2002), "Scheduling with generalized disjunctive graphs: Feasibility issues", XV Conference of the European Chapter on Combinatorial Optimization (ECCO XV), May 30 - June 1, 2002, Lugano, Switzerland. <a href="/wiki/European_Chapter_on_Combinatorial_Optimization" target="_blank">/wiki/European_Chapter_on_Combinatorial_Optimization</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Olson, Lars E. (August 2003), Querying Disjunctive Databases in Polynomial Time (PDF), Master's thesis, Brigham Young University, Department of Computer Science. <a href="http://www.deg.byu.edu/papers/lars_thesis.pdf" target="_blank">http://www.deg.byu.edu/papers/lars_thesis.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Roy, S.; Sussman, B. (December 1964), Les problemes d'ordonnancement avec contraintes disjonctives, Note D.S. No. 9 bis, SEMA. <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> </ol>