Makespan minimization in projects with threshold activities

Eugene Levner, Shao Chin Sung, Milan Vlach

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


The problem of minimizing the duration of a project is studied in situations involving activities which can be started only after a prescribed number of immediately preceding activities have been performed. A strongly polynomial Dijkstra-type algorithm for solving the problem is proposed and analyzed. The algorithm is applicable to projects with activities of positive lengths, even if the underlying precedence graph contains cycles.

Original languageEnglish
Pages (from-to)195-204
Number of pages10
JournalAsia-Pacific Journal of Operational Research
Issue number2
StatePublished - Nov 2002
Externally publishedYes


  • AND/OR graphs
  • Dijkstra-type algorithm
  • Project scheduling
  • Threshold activities


Dive into the research topics of 'Makespan minimization in projects with threshold activities'. Together they form a unique fingerprint.

Cite this