Mixed-integer linear programming for project scheduling under various resource constraints

DOI10.1016/J.EJOR.2024.06.036MaRDI QIDQ6982617zbMATH OpenFDO

Authors Nicklas Klein, Mario Gnägi, Norbert Trautmann

Publication date 16 May 2025

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

project schedulingmixed-integer linear programmingresource-constrained project schedulingconsumption and production of resources

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cites work

• A review of the contribution of operational research to project management
• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
• An updated survey of variants and extensions of the resource-constrained project scheduling problem
• Event-based MILP models for resource-constrained project scheduling problems
• Going to the core of hard resource-constrained project scheduling instances
• Insertion techniques for static and dynamic resource-constrained project scheduling.
• MIP-based solution approaches for multi-site resource-constrained project scheduling
• PSPLIB -- a project scheduling problem library
• Progress in mathematical programming solvers from 2001 to 2020
• Project scheduling with inventory constraints
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Scheduling subject to resource constraints: Classification and complexity
• The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm

This page was built for publication: Mixed-integer linear programming for project scheduling under various resource constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982617)