| ATC |
This class implements the Apparent Tardiness Costs rule by Vepsalainen and
Morton (1987).
|
| CR |
This class implements the Critical Ratio rule and some of its variants,
developed by Rose (2002), doi:10.1109/WSC.2002.1166410.
|
| CR.Variant1 |
|
| CR.Variant2 |
|
| EDD |
This class implements the Earliest Due Date first rule.
|
| FASFS |
This class implements the First Arrival at Shop First Served rule.
|
| FCFS |
This class implements the First Come First Served rule, also known as FIFO
(First In (buffer) First Out).
|
| MDD |
This class implements the Modified Due Date rule, developed by Baker and
Bertrand (1982) and Baker and Kanet (1983).
|
| MOD |
This class implements the Modified Operation Due Date rule, developed by
Baker and Kanet (1983).
|
| ODD |
This class implements the Operation Due Date rule.
|
| RND |
Implements the random rule, i.e., each waiting job has an equal chance of
being selected.
|
| SI |
This rule implements a truncated version of SPT, often referred to as SI^x,
see e.g.
|
| SLK |
This rule implements the Least (global) Slack rule.
|
| SPT |
This class implements the Shortest Processing Time rule.
|
| SRPT |
This class implements the Shortest Remaining Processing Time rule, which
equals SPT for problems with only one work center.
|
| SRPTPerPT |
This class implements the Remaining Processing Time per Imminent Processing
Time rule.
|
| SRPTPerSLK |
This rule implements the "remaining processing time per slack" rule.
|
| TieBreakerFASFS |
This class implements a rule that sequences job in increasing order of their
job number.
|