The minimum dummy task problem

DOI10.1002/NET.3230160308MaRDI QIDQ3787785zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On the computational complexity of the minimum-dummy-activities problem in a pert network
• A new method for constructing a minimal PERT network
• scientific article; zbMATH DE number 1339495
• scientific article; zbMATH DE number 4057259
• A heuristic for constructing activity-on-arrow pert networks with minimal dummy activities

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Single Machine Scheduling with Precedence Constraints of Dimension 2

Cited in

(5)

• Parallel \(N\)-free order recognition
• New heuristics for modeling temporal constraints and generating PERT network with minimum number of dummy-arcs
• On the computational complexity of the minimum-dummy-activities problem in a pert network
• On the minimum dummy-arc problem
• A new method for constructing a minimal PERT network

This page was built for publication: The minimum dummy task problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787785)