blob: bae953228925952023a4bd777233fbc30fedcc21 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
;;; scheduler.el --- Sketches of scheduling -*- lexical-binding: t -*-
;; Author: William Carroll <wpcarro@gmail.com>
;;; Commentary:
;; Attempting to create a FSM for scheduling things in various ways:
;;
;; Scheduling policies:
;; - earliest due date: minimizes total lateness of all tasks in a pool. Put
;; the task with the latest due date last in the list and work backwards to
;; solve the precedence constraint (i.e. dependency issue).
;; - shortest processing time: maximizes number of tasks completed. Prioritize
;; tasks in the order of how long they will take to complete from shortest to
;; longest. This breaks down when precedence constraints are introduced.
;;
;; Tasks should inherit prioritization.
;;; Code:
(provide 'scheduler)
;;; scheduler.el ends here
|
