| ATCS |
This class implements the Apparent Tardiness Costs with Setups rule,
developed by Lee and Pinedo (1997).
|
| DK |
This class implements the DK rule, developed by Mahmoodi and Dooley (1991),
see also Pickardt and Branke (2012).
|
| ECR |
This class implements the Enhanced Critical Ratio rule, developed by Chiang
and Fu (2009), see also Pickardt and Branke (2012).
|
| FCR |
This class implements the Family Critical Ratio rule, developed by Kim and
Bobrowski (1994), which assigns highest priority to all jobs that belong to
the family which includes the job with the lowest critical ratio, see also
Pickardt and Branke (2012).
|
| FEDD |
This class implements the Family Earliest Due Date rule, developed by
Mahmoodi et al. (1990), which assigns highest priority to all jobs that
belong to the family which includes the job with the earliest due date, see
also Pickardt and Branke (2012).
|
| FFCFS |
This class implements the Family First Come First Served rule, developed by
Flynn (1987), which assigns highest priority to all jobs that belong to the
family which includes the job that arrived first to the queue, see also
Pickardt and Branke (2012).
|
| MASP |
This class implements the Minimum Average Setup plus Processing time rule,
developed by Russell and Philipoom (1991), which assigns highest priority to
all jobs that belong to the family with the shortest processing time per job,
see also Pickardt and Branke (2012).
|
| MMS |
This class implements the Minimum Marginal Setup time rule, developed by Arzi
and Raviv (1998), which assigns highest priority to all jobs that belong to
the family with the shortest setup time per job, see also Pickardt and Branke
(2012).
|
| SetupAvoidance |
Returns a priority of +1 if setup states of the machine matches the setup
state required by a job, or -1 otherwise.
|
| SNSPT |
This class implements the Shortest Normalized Setup and Processing Time rule,
see Pickardt and Branke (2012).
|
| SSPT |
This class implements the Shortest Setup and Processing Time rule, developed
by Wilbrecht and Prescott (1969), which selects the job that can be completed
the quickest, see also Pickardt and Branke (2012).
|
| SST |
This class implements the Shortest Setup Time rule.
|
| WBPT |
This class implements the Weighted Batch Processing Time rule, developed by
Raman et al. (1989), which is an additive combination of MMS and SPT, see
also Pickardt and Branke (2012).
|