From mboxrd@z Thu Jan 1 00:00:00 1970 From: John Kitchin Subject: =?UTF-8?B?UmU6IERyIFdvem5pYWvigJlzIHRhc2tsaXN0IGltcGxlbWVudGF0?= =?UTF-8?B?aW9u?= Date: Sun, 29 Jan 2017 16:22:18 -0500 Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 8bit Return-path: Received: from eggs.gnu.org ([2001:4830:134:3::10]:49344) by lists.gnu.org with esmtp (Exim 4.71) (envelope-from ) id 1cXwvZ-0002UJ-G9 for emacs-orgmode@gnu.org; Sun, 29 Jan 2017 16:22:26 -0500 Received: from Debian-exim by eggs.gnu.org with spam-scanned (Exim 4.71) (envelope-from ) id 1cXwvW-0007UA-BE for emacs-orgmode@gnu.org; Sun, 29 Jan 2017 16:22:25 -0500 Received: from mail-qk0-x22d.google.com ([2607:f8b0:400d:c09::22d]:33606) by eggs.gnu.org with esmtps (TLS1.0:RSA_AES_128_CBC_SHA1:16) (Exim 4.71) (envelope-from ) id 1cXwvW-0007Ts-74 for emacs-orgmode@gnu.org; Sun, 29 Jan 2017 16:22:22 -0500 Received: by mail-qk0-x22d.google.com with SMTP id s140so112398682qke.0 for ; Sun, 29 Jan 2017 13:22:20 -0800 (PST) In-reply-to: List-Id: "General discussions about Org-mode." List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Errors-To: emacs-orgmode-bounces+geo-emacs-orgmode=m.gmane.org@gnu.org Sender: "Emacs-orgmode" To: Michal Rus Cc: =?utf-8?Q?Rafa=C5=82?= Babinicz , emacs-orgmode@gnu.org I do not know of anything like this, but it should not be difficult to implement. You could store $ and time as properties in a headline, and then write a custom sort function for use with org-sort-entries that computes the priority and sorts in the direction you want. I do not know how you would integrate that into the agenda, but I assume it is possible. Michal Rus writes: > Hello! > > I’d like to start using dr Wozniak’s tasklist idea [1] in Org. He’s > the original author of spaced repetition and SuperMemo. > > It’s about assigning values ($) and time (hrs) to each task. Then, > priorities ($ divided by hrs) can be calculated, and then you do the > tasks with the highest priority; effectively, spending your time in > the most valuable way. (That is if you assign the value and time > correctly, but it can be learned.) > > Is there anything like that implemented? I couldn’t find anything. > > If not, how hard would it be? Where would it be best to start? > > Thank you! > > [1] https://www.supermemo.com/articles/tasklists.htm -- Professor John Kitchin Doherty Hall A207F Department of Chemical Engineering Carnegie Mellon University Pittsburgh, PA 15213 412-268-7803 @johnkitchin http://kitchingroup.cheme.cmu.edu