An optimal schedule time of a job shop-like disjunctive graph. Ashour, S., Chiu, K. Y., & Moore, T. E. Networks, 3(4):333-349, 1973.
An optimal schedule time of a job shop-like disjunctive graph. [link]Link  An optimal schedule time of a job shop-like disjunctive graph. [link]Paper  bibtex   
@article{ journals/networks/AshourCM73,
  added-at = {2013-02-14T00:00:00.000+0100},
  author = {Ashour, S. and Chiu, K. Y. and Moore, T. E.},
  biburl = {http://www.bibsonomy.org/bibtex/261c922bbbd6624b3b09e07e832346a77/dblp},
  ee = {http://dx.doi.org/10.1002/net.3230030405},
  interhash = {3314e9c44fba1bde4a143d327c7a6650},
  intrahash = {61c922bbbd6624b3b09e07e832346a77},
  journal = {Networks},
  keywords = {dblp},
  number = {4},
  pages = {333-349},
  title = {An optimal schedule time of a job shop-like disjunctive graph.},
  url = {http://dblp.uni-trier.de/db/journals/networks/networks3.html#AshourCM73},
  volume = {3},
  year = {1973}
}
Downloads: 0