Pages that link to "Item:Q2487846"

The following pages link to A branch-and-cut algorithm for scheduling of projects with variable-intensity activities (Q2487846):

Displaying 28 items.

• Editorial ``Project management and scheduling'' (Q280155) (← links)
• A rough-cut capacity planning model with overlapping (Q280165) (← links)
• Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities (Q280170) (← links)
• Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions (Q280177) (← links)
• Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions (Q284842) (← links)
• MIP models for resource-constrained project scheduling with flexible resource profiles (Q297247) (← links)
• Resource loading with time windows (Q319369) (← links)
• Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource (Q328919) (← links)
• Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
• Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound (Q766253) (← links)
• Time-constrained project scheduling (Q835591) (← links)
• Polyhedral results on single node variable upper-bound flow models with allowed configurations (Q865750) (← links)
• A hybrid exact method for a scheduling problem with a continuous resource and energy constraints (Q890001) (← links)
• A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement (Q900590) (← links)
• Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← links)
• Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning (Q964848) (← links)
• A survey of variants and extensions of the resource-constrained project scheduling problem (Q992569) (← links)
• A priority-rule method for project scheduling with work-content constraints (Q1046055) (← links)
• Scheduling shared continuous resources on many-cores (Q1617293) (← links)
• Resource-constrained project scheduling with flexible resource profiles in continuous time (Q1652311) (← links)
• Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem (Q1732114) (← links)
• Scheduling medical residents' training at university hospitals (Q1755256) (← links)
• Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm (Q1935550) (← links)
• Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
• A common approximation framework for early work, late work, and resource leveling problems (Q2184097) (← links)
• Benders decomposition for a period-aggregated resource leveling problem with variable job duration (Q2668707) (← links)
• A project scheduling problem with periodically aggregated resource-constraints (Q2669745) (← links)
• Polyhedral Results and Branch-and-Cut for the Resource Loading Problem (Q4995060) (← links)