An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724): Difference between revisions

Latest revision as of 09:19, 19 August 2024

scientific article; zbMATH DE number 7766437

Language	Label	Description	Also known as
English	An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem	scientific article; zbMATH DE number 7766437

Statements

instance of

scholarly article

0 references

title

An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (English)

0 references

0 references

0 references

0 references

0 references

International Transactions in Operational Research

0 references

publication date

16 November 2023

0 references

zbMATH Keywords

resource-constrained project scheduling

0 references

time-bucket relaxation

0 references

mixed integer linear programming

0 references

matheuristics

0 references

particle therapy

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1111/itor.12445

0 references

cites work

On the strength of time-indexed formulations for the resource-constrained project scheduling problem

0 references

A note on ``Event-based MILP models for resource-constrained project scheduling problems''

0 references

On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation

0 references

A rough-cut capacity planning model with overlapping

0 references

A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling

0 references

A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations

0 references

Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound

0 references

An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations

0 references

Time-Indexed Formulations and the Total Weighted Tardiness Problem

0 references

A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems

0 references

The Continuous-Time Service Network Design Problem

0 references

Algorithm 457: finding all cliques of an undirected graph

0 references

Resource-constrained project scheduling: Notation, classification, models, and methods

0 references

Lower bounds for the event scheduling problem with consumption and production of resources

0 references

A note on the problem of reporting maximal cliques

0 references

Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints

0 references

A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows

0 references

Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem

0 references

A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem

0 references

Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

A solution approach to find the critical path in a time-constrained activity network

0 references

Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements

0 references

A survey of variants and extensions of the resource-constrained project scheduling problem

0 references

Planning and Scheduling by Logic-Based Benders Decomposition

0 references

Event-based MILP models for resource-constrained project scheduling problems

0 references

Q3951897

0 references

A dual heuristic for mixed integer programming

0 references

Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model

0 references

Consistency in networks of relations

0 references

Solving Project Scheduling Problems by Minimum Cut Computations

0 references

Q4437036

0 references

LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search

0 references

An integer programming approach to the multimode resource-constrained multiproject scheduling problem

0 references

Identifiers

DOI

10.1111/itor.12445

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6066724

@@ Property / full work available at URL @@
+https://doi.org/10.1111/itor.12445
+Normal rank
@@ Property / OpenAlex ID @@
+W2599096304
@@ Property / OpenAlex ID: W2599096304 / rank @@
+Normal rank
@@ Property / cites work @@
+On the strength of time-indexed formulations for the resource-constrained project scheduling problem
+Normal rank
@@ Property / cites work @@
+A note on ``Event-based MILP models for resource-constrained project scheduling problems''
+Normal rank
@@ Property / cites work @@
+On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
+Normal rank
@@ Property / cites work @@
+A rough-cut capacity planning model with overlapping
+Normal rank
@@ Property / cites work @@
+A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
+Normal rank
@@ Property / cites work @@
+A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
+Normal rank
@@ Property / cites work @@
+Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
+Normal rank
@@ Property / cites work @@
+An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
+Normal rank
@@ Property / cites work @@
+Time-Indexed Formulations and the Total Weighted Tardiness Problem
+Normal rank
@@ Property / cites work @@
+A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems
+Normal rank
@@ Property / cites work @@
+The Continuous-Time Service Network Design Problem
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+Resource-constrained project scheduling: Notation, classification, models, and methods
+Normal rank
@@ Property / cites work @@
+Lower bounds for the event scheduling problem with consumption and production of resources
+Normal rank
@@ Property / cites work @@
+A note on the problem of reporting maximal cliques
+Normal rank
@@ Property / cites work @@
+Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
+Normal rank
@@ Property / cites work @@
+A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
+Normal rank
@@ Property / cites work @@
+A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+A solution approach to find the critical path in a time-constrained activity network
+Normal rank
@@ Property / cites work @@
+Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
+Normal rank
@@ Property / cites work @@
+A survey of variants and extensions of the resource-constrained project scheduling problem
+Normal rank
@@ Property / cites work @@
+Planning and Scheduling by Logic-Based Benders Decomposition
+Normal rank
@@ Property / cites work @@
+Event-based MILP models for resource-constrained project scheduling problems
+Normal rank
@@ Property / cites work @@
+Q3951897
@@ Property / cites work: Q3951897 / rank @@
+Normal rank
@@ Property / cites work @@
+A dual heuristic for mixed integer programming
@@ Property / cites work: A dual heuristic for mixed integer programming / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
+Normal rank
@@ Property / cites work @@
+Consistency in networks of relations
@@ Property / cites work: Consistency in networks of relations / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Project Scheduling Problems by Minimum Cut Computations
+Normal rank
@@ Property / cites work @@
+Q4437036
@@ Property / cites work: Q4437036 / rank @@
+Normal rank
@@ Property / cites work @@
+LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
+Normal rank
@@ Property / cites work @@
+An integer programming approach to the multimode resource-constrained multiproject scheduling problem
+Normal rank