Research Article
Solving Integrated Process Planning, Dynamic Scheduling, and Due Date Assignment Using Metaheuristic Algorithms
| Rule No | Name | Explanation | Equations |
| 0-1-2 | WATC | Weighted Apparent Tardiness Cost | | 3-4-5 | ATC | Apparent Tardiness Cost | | 6 | WMS | Weighted Minimum Slack | | 7 | MS | Minimum Slack | | 8 | WSPT | Weighted shortest process time | | 9 | SPT | Shortest process time | | 10 | WLPT | Weighted longest process time | | 11 | LPT | Longest process time | | 12 | WSOT | Weighted shortest operation time | | 13 | SOT | Shortest operation time | | 14 | WLOT | Weighted longest operation time | | 15 | LOT | Longest operation time | | 16 | EDD | Earliest due date | | 17 | WEDD | Weighted Earliest due date | | 18 | ERD | Earliest release date | | 19 | WERD | Weighted earliest release date | | 20 | SIRO | Service in random order | | 21 | FIFO | First in first out | | 22 | LIFO | Last in first out | |
|
|