Makespan minimization in projects with threshold activities

MaRDI QIDQ3626432zbMATH OpenFDO

Authors Eugene Levner, S-C. Sung, Milan Vlach

Publication date 22 May 2009

zbMATH Keywords

project schedulingAND/OR graphsDijkstra-type algorithmthreshold activities

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm
• Critical path in an activity network with time constraints
• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
• Scheduling of project networks
• PERT scheduling with convex cost functions.

Cited in

(3)

• Developing activity duration specification limits for effective project control
• A characterization for tropical polynomials being the minimum finishing time of project networks
• Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm

This page was built for publication: Makespan minimization in projects with threshold activities

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