A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
From MaRDI portal
Publication:2487846
DOI10.1007/s10107-004-0551-6zbMath1125.90019OpenAlexW2023044784MaRDI QIDQ2487846
Publication date: 8 August 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-004-0551-6
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (28)
Scheduling shared continuous resources on many-cores ⋮ Editorial ``Project management and scheduling ⋮ A rough-cut capacity planning model with overlapping ⋮ Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities ⋮ Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions ⋮ Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions ⋮ Time-constrained project scheduling ⋮ MIP models for resource-constrained project scheduling with flexible resource profiles ⋮ Resource loading with time windows ⋮ Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource ⋮ Resource-constrained project scheduling with flexible resource profiles in continuous time ⋮ Polyhedral results on single node variable upper-bound flow models with allowed configurations ⋮ Benders decomposition for a period-aggregated resource leveling problem with variable job duration ⋮ A project scheduling problem with periodically aggregated resource-constraints ⋮ A common approximation framework for early work, late work, and resource leveling problems ⋮ A hybrid exact method for a scheduling problem with a continuous resource and energy constraints ⋮ Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement ⋮ Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements ⋮ Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem ⋮ Scheduling medical residents' training at university hospitals ⋮ Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound ⋮ Polyhedral Results and Branch-and-Cut for the Resource Loading Problem ⋮ A priority-rule method for project scheduling with work-content constraints ⋮ Packing-based branch-and-bound for discrete malleable task scheduling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- PSPLIB -- a project scheduling problem library
- Resource-constrained project scheduling: A survey of recent developments.
- Project scheduling. A research handbook.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Maximal Flow Through a Network
- Valid Linear Inequalities for Fixed Charge Problems
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- A review of the contribution of operational research to project management
This page was built for publication: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
