Anchored rescheduling problems under generalized precedence constraints

DOI10.1007/978-3-030-53262-8_13MaRDI QIDQ2225060zbMATH OpenOpenAlexFDO

Authors Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau

Publication date 4 February 2021

Full work available at URL https://doi.org/10.1007/978-3-030-53262-8_13

zbMATH Keywords

reschedulinganchored jobsdeadline constraintsgeneralized precedence graph

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Rescheduling for multiple new orders
• Rescheduling for job unavailability
• Rescheduling with new orders and general maximum allowable time disruptions
• Rescheduling problems with allowing for the unexpected new jobs arrival
• Rescheduling for New Orders

Cited in

(5)

• Exact and heuristic methods for Anchor-Robust and Adjustable-Robust RCPSP
• Anchored rescheduling problem with non-availability periods
• Anchored reactive and proactive solutions to the CPM-scheduling problem
• Anchor-robust project scheduling with non-availability periods
• Dominance-based linear formulation for the anchor-robust project scheduling problem

This page was built for publication: Anchored rescheduling problems under generalized precedence constraints

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