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

Table 3

Test results of priority rules for 50-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	15	0.99	10	0.99	17	0.99
Loose	Limited	3	0.97	0	0.00	20	1.00	1	0.96	0	0.94	1	0.98
	Short	0	0.76	0	0.00	13	0.99	0	0.70	1	0.95	6	0.99
	Sufficient	13	0.99	0	0.00	19	1.00	10	0.99	6	0.99	14	0.99
Normal	Limited	0	0.80	0	0.00	16	0.99	0	0.73	1	0.97	4	0.98
	Short	0	0.23	0	0.11	4	0.97	0	0.11	9	0.98	9	0.99
	Sufficient	0	0.79	0	0.00	15	0.99	0	0.75	5	0.98	1	0.98
Tight	Limited	0	0.12	0	0.26	11	0.99	0	0.00	6	0.99	6	0.98
	Short	0	0.11	0	0.68	6	0.98	0	0.00	11	0.99	7	0.98
Sum/average		33	0.64	0	0.12	124	0.99	26	0.58	49	0.98	65	0.99

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