Pages that link to "Item:Q398922"

The following pages link to A preemptive bound for the resource constrained project scheduling problem (Q398922):

Displaying 12 items.

• An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration (Q319357) (← links)
• An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations (Q439614) (← links)
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations (Q709101) (← links)
• Approximability results for the resource-constrained project scheduling problem with a single type of resources (Q744638) (← links)
• Tight LP bounds for resource constrained project scheduling (Q1880319) (← links)
• A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints (Q2029253) (← links)
• Two deadline reduction algorithms for scheduling dependent tasks on parallel processors (Q2117220) (← links)
• A polyhedral study of event-based models for the resource-constrained project scheduling problem (Q2173056) (← links)
• Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
• Pre-emption in resource-constrained project scheduling (Q2482791) (← links)
• (Q3426433) (← links)
• Measuring the slack between lower bounds for scheduling on parallel machines (Q6588485) (← links)