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

DOI10.1016/j.cor.2009.11.013zbMath1190.90033OpenAlexW2002864934WikidataQ58921462 ScholiaQ58921462MaRDI QIDQ2270440

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

critical pathtime-constrained networkactivity networktime-window constrainttime-schedule constrainttime-switch constraint

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (3)

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 ⋮ Evaluating project completion time in project networks with discrete random activity durations

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
• A reoptimization algorithm for the shortest path problem with time windows
• The pickup and delivery problem with time windows
• A parametric critical path problem and an application for cyclic scheduling
• Critical path in an activity network with time constraints
• PSPLIB -- a project scheduling problem library
• Minimum time paths in a network with mixed time constraints.
• Finding the critical path in an activity network with time-switch constraints
• 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
• A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
• Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Discrete time/cost trade-offs in project scheduling with time-switch constraints

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