Anchor-robust project scheduling with non-availability periods

DOI10.1016/J.DISOPT.2024.100864MaRDI QIDQ6670507

Bruno Escoffier, Pascale Bendotti, Philippe Chrétienne, Luca Brunod-Indrigo

Publication date: 23 January 2025

Published in: Discrete Optimization (Search for Journal in Brave)

zbMATH Keywords

project schedulingnon-availability periodsanchor robustness

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Theory of computing (68Qxx) Operations research and management science (90Bxx)

Cites Work

• Models and algorithms for robust PERT scheduling with time-dependent tast durations
• Robust discrete optimization and network flows
• Adjustable robust solutions of uncertain linear programs
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Anchored reactive and proactive solutions to the CPM-scheduling problem
• The construction of stable project baseline schedules
• Scheduling with limited machine availability
• A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization
• Anchored rescheduling problems under generalized precedence constraints
• Dominance-based linear formulation for the anchor-robust project scheduling problem
• Robust convex optimization
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• The Anchor-Robust Project Scheduling Problem

This page was built for publication: Anchor-robust project scheduling with non-availability periods

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