A solution approach to find the critical path in a time-constrained activity network

DOI10.1016/J.COR.2009.11.013MaRDI QIDQ2270440zbMATH OpenOpenAlexWikidataFDO

Authors Francesca Guerriero, Luca Talarico

Publication date 18 March 2010

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2009.11.013

zbMATH Keywords

activity networkcritical pathtime-constrained networktime-schedule constrainttime-switch constrainttime-window constraint

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Critical path in an activity network with time constraints
• Finding the critical path in an activity network with time-switch constraints
• On the latest starting times and criticality of activities in a network with imprecise durations
• scientific article; zbMATH DE number 4135692
• Cost/time trade-off analysis for the critical path method: a derivation of the network flow approach

Cites work

• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
• A parametric critical path problem and an application for cyclic scheduling
• A reoptimization algorithm for the shortest path problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Critical path in an activity network with time constraints
• Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
• Cyclic scheduling problems.
• Discrete time/cost trade-offs in project scheduling with time-switch constraints
• Finding the critical path in an activity network with time-switch constraints
• scientific article; zbMATH DE number 3599820 (Why is no real title available?)
• scientific article; zbMATH DE number 3249566 (Why is no real title available?)
• scientific article; zbMATH DE number 956787 (Why is no real title available?)
• Minimum time paths in a network with mixed time constraints.
• Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
• New computational results for the discrete time/cost trade-off problem with time-switch constraints
• Path critical index and activity critical index in PERT networks
• PSPLIB -- a project scheduling problem library
• Scheduling algorithms
• The pickup and delivery problem with time windows

Cited in

(7)

• Evaluating project completion time in project networks with discrete random activity durations
• Critical path in an activity network with time constraints
• Finding the critical path in an activity network with time-switch constraints
• A new approach to determine the critical path in stochastic activity network
• Small-m method for detecting all longest paths
• An innovative operation‐time‐space network for solving different logistic problems with capacity and time constraints
• An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem

Describes a project that uses

Uses Software

• PSPLIB

This page was built for publication: A solution approach to find the critical path in a time-constrained activity network

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