AIT-S for Single-Machine Weighted Tardiness Problem
This paper concentrates on the newly improved algorithm for solving the single-machine total weighted tardiness (SMTWT) problem, called Algorithm Inspired by Tree and Sorting (AIT-S). The algorithm is based on searching the solution space along with the tree and sorting rules. The properties of the...
| Những tác giả chính: | , , , |
|---|---|
| Định dạng: | Bài viết |
| Ngôn ngữ: | English |
| Được phát hành: |
World Scientific Publishing
2019-08-01
|
| Loạt: | Vietnam Journal of Computer Science |
| Những chủ đề: | |
| Truy cập trực tuyến: | http://www.worldscientific.com/doi/pdf/10.1142/S2196888819500106 |