Pages that link to "Item:Q3882171"

The following pages link to Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study (Q3882171):

Displaying 37 items.

• Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers (Q421579) (← links)
• Better permutations for the single-processor scheduling with time restrictions (Q523167) (← links)
• Multi-mode resource-constrained project scheduling problem with material ordering under bonus-penalty policies (Q526633) (← links)
• Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
• Some efficient multi-heuristic procedures for resource-constrained project scheduling (Q721676) (← links)
• Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems (Q721682) (← links)
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints (Q791440) (← links)
• Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
• A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing (Q833427) (← links)
• Scheduling projects with limited number of preemptions (Q1025235) (← links)
• A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem (Q1037664) (← links)
• Scheduling subject to resource constraints: Classification and complexity (Q1052820) (← links)
• Multiobjective network scheduling with efficient use of renewable and nonrenewable resources (Q1150305) (← links)
• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem (Q1266548) (← links)
• A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes (Q1266549) (← links)
• PSPLIB -- a project scheduling problem library (Q1278481) (← links)
• A local constraint based analysis approach to project scheduling under general resource constraints (Q1342067) (← links)
• An exact algorithm for project scheduling with multiple modes (Q1372766) (← links)
• Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
• The preemptive stochastic resource-constrained project scheduling problem (Q1735185) (← links)
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
• Multimode time-cost-robustness trade-off project scheduling problem under uncertainty (Q2156293) (← links)
• The impact of a limited budget on the corrective action taking process (Q2189899) (← links)
• An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances (Q2256244) (← links)
• Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods) (Q2277354) (← links)
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)
• A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages (Q2356251) (← links)
• Pre-emption in resource-constrained project scheduling (Q2482791) (← links)
• Stochastic scheduling to minimize expected maximum lateness (Q2482822) (← links)
• A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling (Q2519076) (← links)
• Preemptive scheduling with staircase and piecewise linear resource availability (Q3830806) (← links)
• Scheduling unit-time tasks in renewable resource constrained flowshops (Q4031376) (← links)
• Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction Mechanisms (Q5143361) (← links)
• An innovative four-layer heuristic for scheduling multi-mode projects under multiple resource constrains (Q5244304) (← links)
• A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem (Q5246811) (← links)
• An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem (Q6588464) (← links)