Citation
On Project Scheduling With And/or Precedence Constraints. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 597-606, 2005.
Paper
Abstract
We address a PERT/CPM scheduling problem with AND/OR constraints and examine its relations with extremal problems in grammars and hypergraphs. We demonstrate that two scheduling algorithms developed independently by Adelson-Velsky et al. (2002) and Mohring et al. (2004) have different worst-case complexity and, in a sense, are incomparable.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2005-597-606-P, author = {G. Adelson-Velsky and A. Gelbukh and E. Levner},
title = {On Project Scheduling With And/or Precedence Constraints},
booktitle = {In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA},
year = {2005},
editor = {G. Kendall and L. Lei and M. Pinedo},
pages = {597--606},
note = {Paper},
abstract = {We address a PERT/CPM scheduling problem with AND/OR constraints and examine its relations with extremal problems in grammars and hypergraphs. We demonstrate that two scheduling algorithms developed independently by Adelson-Velsky et al. (2002) and Mohring et al. (2004) have different worst-case complexity and, in a sense, are incomparable.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-597-606-P.pdf} }