Solution of interval PERT/CPM network problems by a simplified tabular method

DOI10.1007/S12597-011-0056-ZMaRDI QIDQ505096zbMATH OpenOpenAlexFDO

Authors Sathi Mukherjee, Kajla Basu

Publication date 19 January 2017

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12597-011-0056-z

zbMATH Keywords

critical pathfloatinterval activity timeinterval numbersnetwork flowsPERT/CPMproject management

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Management decision making, including multiple objectives (90B50) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Recommendations

• An approximate solution to the PERT problem
• A Modulo Network Simplex Method for Solving Periodic Timetable Optimisation Problems
• A discrete-time approximation technique for the time-cost trade-off in PERT networks
• Publication:5750692
• A Simple Approximation to the Completion Time Distribution for a PERT Network
• A new method for constructing a minimal PERT network
• scientific article; zbMATH DE number 15416
• scientific article; zbMATH DE number 1234734

Cites work

• A genetic algorithm approach for the time-cost trade-off in PERT networks
• A multi-objective resource allocation problem in dynamic PERT networks
• An upper bound on the expected completion time of PERT networks
• Analysis of critical paths in a project network with fuzzy activity times
• Applying fuzzy method for measuring criticality in project network
• Critical path analysis in the network with fuzzy activity times
• Fuzzy sets
• Fuzzy temporal characteristics of operations for project management on the network models basis
• scientific article; zbMATH DE number 3649911 (Why is no real title available?)
• scientific article; zbMATH DE number 48957 (Why is no real title available?)
• scientific article; zbMATH DE number 51639 (Why is no real title available?)
• Multiobjective programming in optimization of the interval objective function
• ON ARITHMETIC OPERATIONS OF INTERVAL NUMBERS
• On comparing interval numbers
• On computing the latest starting times and floats of activities in a network with imprecise durations
• On latest starting times and floats in activity networks with ill-known durations
• On the hardness of evaluating criticality of activities in a planar network with duration intervals
• Ranking fuzzy interval numbers in the setting of random sets
• Ranking fuzzy interval numbers in the setting of random sets -- further results
• Ranking fuzzy numbers in the setting of possibility theory
• Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
• The Completion Time of PERT Networks
• The Completion Time of PERT Networks
• The computational complexity of the criticality problems in a network with interval activity times
• The use of fuzzy variables in PERT
• Toward a generalized theory of uncertainty (GTU) -- an outline

Cited in

(4)

• Evolutionary algorithms for multi-objective stochastic resource availability cost problem
• Fast minimum float computation in activity networks under interval uncertainty
• scientific article; zbMATH DE number 7527885 (Why is no real title available?)
• Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks

This page was built for publication: Solution of interval PERT/CPM network problems by a simplified tabular method

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