An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem

•Energetic Reasoning is one of the most powerful methods for efficient cumulative scheduling.•Energetic Reasoning computes destructive bounds and time-bound adjustments.•Energetic Reasoning is not commonly used in practice due to its time complexity.•We present a new algorithm for time-bound adjustm...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 2020-10, Vol.286 (2), p.468-476
Hauptverfasser:	Carlier, J., Pinson, E., Sahli, A., Jouglet, A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Adjustment Computer Science Cumulative resource Energetic reasoning Operations Research Scheduling
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!