Lot-Order Assignment Applying Priority Rules for the Single-Machine Total Tardiness Scheduling with Nonnegative Time-Dependent Processing Times

Table 4

Test results of priority rules for 100 order problems.

Due date; tightness	Number of lots	EDD		MOQ		MDD		SLACK		COVERT		ATC
		NB^†	ARDI^‡	NB^†	ARDI^‡	NB^†	ARDI^‡	NB^†	ARDI^‡	NB^†	ARDI^‡	NB^†	ARDI^‡
	Sufficient	15	0.99	0	0.00	20	1.00	12	0.99	7	0.99	8	0.99
Loose	Limited	4	0.98	0	0.00	19	1.00	1	0.96	0	0.91	0	0.96
	Short	0	0.53	0	0.00	3	0.96	0	0.45	4	0.97	13	0.99
	Sufficient	10	0.99	0	0.00	19	1.00	9	0.99	3	0.99	7	0.99
Normal	Limited	0	0.67	0	0.00	5	0.97	0	0.60	9	0.99	6	0.98
	Short	0	0.09	0	0.38	4	0.97	0	0.00	12	0.98	4	0.97
	Sufficient	0	0.80	0	0.00	12	0.99	0	0.77	8	0.99	0	0.96
Tight	Limited	0	0.07	0	0.41	7	0.98	0	0.00	8	0.99	5	0.98
	Short	0	0.06	0	0.77	8	0.98	0	0.00	9	0.99	3	0.98
Sum/average		29	0.58	0	0.17	97	0.98	22	0.53	60	0.98	46	0.98

Number of the best solutions found.
Average relative deviation index.