The minimum dummy task problem

DOI10.1002/net.3230160308zbMath0644.90054OpenAlexW2144130180MaRDI QIDQ3787785

Jeremy P. Spinrad

Publication date: 1986

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230160308

zbMATH Keywords

heuristic algorithmNP-completeinterval ordersPERT networksmanagement of large projectsseries- parallel partial ordersThe minimum dummy task problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items

Parallel \(N\)-free order recognition ⋮ A new method for constructing a minimal PERT network

Cites Work

• Unnamed Item
• Unnamed Item
• Single Machine Scheduling with Precedence Constraints of Dimension 2