Pages that link to "Item:Q1806914"

The following pages link to Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling (Q1806914):

Displaying 35 items.

• A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations (Q309061) (← links)
• Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation (Q336432) (← links)
• A preemptive bound for the resource constrained project scheduling problem (Q398922) (← links)
• An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations (Q439614) (← links)
• Project scheduling with flexible resources: formulation and inequalities (Q443821) (← links)
• Using dual presolving reductions to reformulate cumulative constraints (Q487651) (← links)
• Scheduling and constraint propagation (Q697570) (← links)
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations (Q709101) (← links)
• Computing redundant resources for the resource constrained project scheduling problem (Q853022) (← links)
• A constraint programming approach for the resource-constrained project scheduling problem (Q940840) (← links)
• \texttt{Absalom}: balancing assembly lines with assignment restrictions (Q1044086) (← links)
• Insertion techniques for static and dynamic resource-constrained project scheduling. (Q1399570) (← links)
• Resource-constrained project scheduling: A critical activity reordering heuristic (Q1399574) (← links)
• Lower bounds for resource-constrained project scheduling problems. (Q1399575) (← links)
• On linear lower bounds for the resource constrained project scheduling problem. (Q1399576) (← links)
• Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. (Q1417510) (← links)
• Solving the resource-constrained project scheduling problem by a variable neighbourhood search. (Q1427560) (← links)
• A linear programming and constraint propagation-based lower bound for the RCPSP (Q1590041) (← links)
• A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem (Q1651597) (← links)
• An exact composite lower bound strategy for the resource-constrained project scheduling problem (Q1652587) (← links)
• Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
• Bidirectional planning: Improving priority rule-based heuristics for scheduling resource-constrained projects (Q1841162) (← links)
• An enumerative heuristic and reduction methods for the assembly line balancing problem (Q1869496) (← links)
• The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics (Q1936599) (← links)
• A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects (Q2117197) (← links)
• The sample analysis machine scheduling problem: definition and comparison of exact solving approaches (Q2146991) (← links)
• A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints (Q2197158) (← links)
• The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds (Q2215556) (← links)
• A Boolean satisfiability approach to the resource-constrained project scheduling problem (Q2430594) (← links)
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059) (← links)
• Going to the core of hard resource-constrained project scheduling instances (Q2664304) (← links)
• A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem (Q6106485) (← links)
• Continuous-time formulations for multi-mode project scheduling (Q6164343) (← links)
• A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty (Q6555181) (← links)
• Reducing the feasible solution space of resource-constrained project instances (Q6561212) (← links)