Research Article
Lot-Order Assignment Applying Priority Rules for the Single-Machine Total Tardiness Scheduling with Nonnegative Time-Dependent Processing Times
Table 2
Results with CPLEX.
| Number of orders | Due date tightness | Lots | Number of optimal solutions found | Number of feasible solutions found |
| | | Sufficient | 20 | 20 | | Loose | Limited | 4 | 20 | | | Short | 0 | 20 | | | Sufficient | 15 | 20 | 50 | Normal | Limited | 0 | 20 | | | Short | 0 | 20 | | | Sufficient | 0 | 20 | | Tight | Limited | 0 | 20 | | | Short | 0 | 20 |
| | | Sufficient | 16 | 20 | | Loose | Limited | 3 | 20 | | | Short | 0 | 20 | | | Sufficient | 12 | 20 | 100 | Normal | Limited | 0 | 15 | | | Short | 0 | 17 | | | Sufficient | 0 | 0 | | Tight | Limited | 0 | 19 | | | Short | 0 | 16 |
| | | Sufficient | 16 | 16 | | Loose | Limited | 0 | 0 | | | Short | 0 | 1 | | | Sufficient | 12 | 12 | 200 | Normal | Limited | 0 | 0 | | | Short | 0 | 0 | | | Sufficient | 0 | 0 | | Tight | Limited | 0 | 0 | | | Short | 0 | 0 |
|
|