Iterative converging algorithms for computing bounds on durations of activities in pert and pert-like models

From MaRDI portal

Publication:1411334

Jump to:navigation, search

DOI10.1023/A:1021964105322zbMath1046.90029MaRDI QIDQ1411334

Bing Lu, Eugene Shragowitz, Habib Youssef

Publication date: 27 October 2003

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

scheduling NP-complete problems PERT approximation algorithms critical path directed acyclic graphs duration of activities slack timing bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Allocating slacks in stochastic PERT network ⋮ A rule for slack allocation proportional to the duration in a PERT network

This page was built for publication: Iterative converging algorithms for computing bounds on durations of activities in pert and pert-like models

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1411334&oldid=13574036"