Pages that link to "Item:Q4015267"

The following pages link to The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs) (Q4015267):

Displaying 30 items.

• A float-path theory and its application to the time-cost tradeoff problem (Q305477) (← links)
• A new approach for solving the network problems (Q505104) (← links)
• Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations (Q709101) (← links)
• A path enumeration approach for the analysis of critical activities in fuzzy networks (Q713412) (← links)
• Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound (Q766253) (← links)
• The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← links)
• On no-wait and no-idle flow shops with makespan criterion (Q859679) (← links)
• Maximizing the net present value of a project under uncertainty (Q1039778) (← links)
• Simulated annealing and tabu search for multi-mode project payment scheduling (Q1042041) (← links)
• An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations (Q1265850) (← links)
• Audit scheduling with overlapping activities and sequence-dependent setup costs (Q1278577) (← links)
• A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations (Q1303751) (← links)
• Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production (Q1372767) (← links)
• Activity nets: A guided tour through some recent developments (Q1388902) (← links)
• Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
• Improving project cost estimation by taking into account managerial flexibility (Q1590029) (← links)
• Simplifying the nonlinear continuous time-cost tradeoff problem (Q1697748) (← links)
• A hybrid framework for over-constrained generalized resource-constrained project scheduling problems (Q1768898) (← links)
• New computational results for the discrete time/cost trade-off problem with time-switch constraints (Q1772840) (← links)
• The multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q1807061) (← links)
• Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm (Q1935550) (← links)
• Project scheduling with generalized precedence relations: a new method to analyze criticalities and flexibilities (Q2076817) (← links)
• On the complexity of project scheduling to minimize exposed time (Q2514874) (← links)
• Simplifying activity networks under generalized precedence relations to extended CPM networks (Q2829161) (← links)
• Theory and application of reciprocal transformation of “path problem” and “time float problem” (Q2969956) (← links)
• A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time (Q3064043) (← links)
• A branch‐and‐bound algorithm for scheduling of new product development projects (Q4921224) (← links)
• Work Package Sizing and Project Performance (Q4971582) (← links)