The following pages link to (Q4166568):
Displaying 50 items.
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q280157) (← links)
- MIP models for resource-constrained project scheduling with flexible resource profiles (Q297247) (← links)
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
- Modelling and solving generalised operational surgery scheduling problems (Q342152) (← links)
- Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) (Q363579) (← links)
- New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing (Q539456) (← links)
- Stochastic networks and the extreme value distribution (Q584063) (← links)
- Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
- Criticality analysis of activity networks under interval uncertainty (Q633555) (← links)
- Some efficient multi-heuristic procedures for resource-constrained project scheduling (Q721676) (← links)
- Project bidding under deterministic and probabilistic activity durations (Q721677) (← links)
- The scheduling of activities to maximize the net present value of projects (Q721678) (← links)
- Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems (Q721682) (← links)
- Bi-level multiple mode resource-constrained project scheduling problems under hybrid uncertainty (Q747027) (← links)
- The use of cutsets in Monte Carlo analysis of stochastic networks (Q754751) (← links)
- On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems (Q781900) (← links)
- Optimal control policies for resource allocation in an activity network (Q788627) (← links)
- Preemptive scheduling of independent jobs on parallel machines subject to financial constraints (Q791440) (← links)
- A compact hash function for paths in PERT networks (Q797503) (← links)
- A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing (Q833427) (← links)
- Single machine scheduling problems with controllable processing times and total absolute differences penalties (Q856259) (← links)
- Concurrent visual search and time reproduction with cross-talk (Q882301) (← links)
- Sensitivity analysis of ranked data: from order statistics to quantiles (Q896493) (← links)
- Scheduling of project networks (Q908839) (← links)
- Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
- A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658) (← links)
- A random generator of resource-constrained multi-project network problems (Q964864) (← links)
- A survey of variants and extensions of the resource-constrained project scheduling problem (Q992569) (← links)
- Structured construction and simulation of nondeterministic stochastic activity networks (Q1027622) (← links)
- A priority-rule method for project scheduling with work-content constraints (Q1046055) (← links)
- An upper bound on the expected completion time of PERT networks (Q1060947) (← links)
- Schedule-induced posets (Q1081529) (← links)
- Scheduling tasks on two processors with deadlines and additional resources (Q1084012) (← links)
- Approximating the distribution functions in stochastic networks (Q1085043) (← links)
- Controlled alternative activity networks for project management (Q1107431) (← links)
- The knapsack problem with generalized upper bounds (Q1122484) (← links)
- A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network (Q1124724) (← links)
- Scheduling of design projects with uncertain number of iterations (Q1124816) (← links)
- An intelligent interactive project management support system (Q1129303) (← links)
- The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem (Q1129955) (← links)
- On the measurement of complexity in activity networks (Q1145062) (← links)
- A multi-objective approach to resource allocation in single machine scheduling (Q1173857) (← links)
- An optimal procedure for the single-model deterministic assembly line balancing problem (Q1251981) (← links)
- An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations (Q1265850) (← links)
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation (Q1266547) (← links)
- A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes (Q1266549) (← links)
- Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows (Q1278462) (← links)
- Audit scheduling with overlapping activities and sequence-dependent setup costs (Q1278577) (← links)
- Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application (Q1291582) (← links)
