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

Table 5

Test results of priority rules for 200 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	17	0.99	0	0.00	20	1.00	14	0.99	5	0.99	9	0.99
Loose	Limited	1	0.92	0	0.00	9	0.98	0	0.89	0	0.89	10	0.99
	Short	0	0.11	0	0.34	1	0.82	0	0.01	3	0.90	16	0.99
	Sufficient	12	0.99	0	0.00	20	1.00	9	0.99	5	0.99	2	0.99
Normal	Limited	0	0.46	0	0.00	2	0.93	0	0.37	7	0.97	11	0.99
	Short	0	0.06	0	0.81	0	0.93	0	0.00	8	0.99	12	0.99
	Sufficient	0	0.81	0	0.00	13	0.99	0	079	7	0.99	0	0.94
Tight	Limited	0	0.06	0	0.60	1	0.95	0	0.00	19	1.00	0	0.95
	Short	0	0.05	0	0.93	2	0.95	0	0.00	15	0.99	3	0.97
Sum/average		30	0.50	0	0.30	68	0.95	23	0.45	69	0.97	63	0.98

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