<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Scheduling Algorithms for Procrastinators · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/cs_0606067/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/cs_0606067/feed.xml" rel="self" type="application/rss+xml" /><item><title>Scheduling Algorithms for Procrastinators — mentioned by romwell</title><link>https://news.ycombinator.com/item?id=17192528</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0606067:17192528</guid><pubDate>Wed, 30 May 2018 22:41:20 GMT</pubDate><description>&lt;p&gt;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: &amp;quot;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…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0606067/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
