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

J. Carlier, E. Pinson, A. Sahli and A. Jouglet

European Journal of Operational Research, 2020, vol. 286, issue 2, 468-476

Abstract: Energetic Reasoning (ER) is one of the most powerful methods for efficient cumulative scheduling. It computes destructive bounds and adjustments of task time intervals. ER is not commonly used in practice due to its time complexity, and its efficiency is highly dependent on the tightness of the time intervals. Here, we present a new algorithm with a better complexity than previous algorithms for speeding up time bound adjustments. More precisely, we show how to reduce the complexity of heads and tails adjustments from O(n2log n) to O(n2), which is an important theoretical advance.

Keywords: Scheduling; Cumulative resource; Energetic reasoning; Adjustment (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722172030312X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:286:y:2020:i:2:p:468-476

DOI: 10.1016/j.ejor.2020.03.079

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().