On that note, a relevant read is the following: Scheduling Algorithms for Procrastinators[1] (Michael A. Bender, Raphael Clifford, Kostas Tsichlas). The paper

On that note, a relevant read is the following: Scheduling Algorithms for Procrastinators[1] (Michael A. Bender, Raphael Clifford, Kostas Tsichlas). The paper assumes a linear productivity increase towards the deadline (note: the article proposes a hyperbolic relation), and solves the scheduling problem given this constraint. The paper considers offline and online scheduling cases, and concludes with the following: "It is now several hours later, just minutes before the deadline. We were searching for the ideal way to end the paper and circumstances have unfortunately provided the answer. A campus-wide power failure at Stony Brook has cut two hours from our last-minute working time and highlights the difficulties of online scheduling for procrastinators." [1]https://arxiv.org/abs/cs/0606067 https://arxiv.org/abs/cs/0606067