Pages that link to "Item:Q3277805"

The following pages link to Critical-Path Planning and Scheduling: Mathematical Basis (Q3277805):

Displaying 50 items.

• Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q299837) (← links)
• A float-path theory and its application to the time-cost tradeoff problem (Q305477) (← links)
• A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs (Q319449) (← links)
• Resource allocation in multi-class dynamic PERT networks with finite capacity (Q320114) (← links)
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
• An adaptive crashing policy for stochastic time-cost tradeoff problems (Q342024) (← links)
• Modeling stochastic project time-cost trade-offs with time-dependent activity durations (Q440901) (← links)
• A fuzzy time-dependent project scheduling problem (Q497277) (← links)
• Criticality analysis of activity networks under interval uncertainty (Q633555) (← links)
• A new method for constructing a minimal PERT network (Q646227) (← links)
• Robust resource allocations in temporal networks (Q715076) (← links)
• Optimization models and a GA-based algorithm for stochastic time-cost trade-off problem (Q732489) (← links)
• Models of central capacity and concurrency (Q762011) (← links)
• On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems (Q781900) (← links)
• A parametric algorithm for convex cost network flow and related problems (Q789313) (← links)
• A network flow procedure for project crashing with penalty nodes (Q790038) (← links)
• The discrete time/cost trade-off problem: Extensions and heuristic procedures (Q835571) (← links)
• Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach (Q872140) (← links)
• Knowledge integration using problem spaces: A study in resource-constrained project scheduling (Q880537) (← links)
• Financing and reliability analysis for schedules in the project calendar planning problem (Q893924) (← links)
• Lexicographic solution of two-objective project planning problem under constrained reliability index (Q895303) (← links)
• A multi-objective resource allocation problem in dynamic PERT networks (Q945351) (← links)
• A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658) (← links)
• Fuzzy project scheduling problem and its hybrid intelligent algorithm (Q967803) (← links)
• The risk element transmission theory research of multi-objective risk-time-cost trade-off (Q971715) (← links)
• New fuzzy models for time-cost trade-off problem (Q975376) (← links)
• A minmax regret approach to the critical path method with task interval times (Q1011286) (← links)
• Computing latest starting times of activities in interval-valued networks with minimal time lags (Q1044116) (← links)
• Fuzzy quantities in networks (Q1054256) (← links)
• An intelligent interactive project management support system (Q1129303) (← links)
• The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
• Constructing a stochastic critical path network given the slacks: Representation (Q1196917) (← links)
• A critical path generalization of the additive factor method: Analysis of a stroop task (Q1257857) (← links)
• DAGEN: A generator of testsets for project activity nets (Q1266552) (← links)
• Project management with time, cost, and quality considerations (Q1266596) (← links)
• The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure (Q1296080) (← links)
• On the optimal management of project risk (Q1296106) (← links)
• Optimization analysis for design and planning of multi-project programs (Q1296112) (← links)
• Balancing problems in acyclic networks (Q1327220) (← links)
• Scheduling project activities in a distributed environment (Q1342009) (← links)
• A network flow algorithm for just-in-time project scheduling (Q1342048) (← links)
• Activity nets: A guided tour through some recent developments (Q1388902) (← links)
• Improving project cost estimation by taking into account managerial flexibility (Q1590029) (← links)
• Three-parametrical harmonization model in project management by means of simulation (Q1614038) (← links)
• Approximation algorithms for precedence-constrained identical machine scheduling with rejection (Q1698078) (← links)
• Intuitionistic fuzzy multi-criteria group decision making with an application to critical path selection (Q1730473) (← links)
• Shortest path algorithms for functional environments (Q1751143) (← links)
• A nearest neighbour extension to project duration forecasting with artificial intelligence (Q1751933) (← links)
• New model and heuristics for safety stock placement in general acyclic supply chain networks (Q1762120) (← links)
• Network decomposition-based benchmark results for the discrete time-cost tradeoff problem (Q1772839) (← links)