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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
World Scientific Publishing
2019-08-01
|
| Series: | Vietnam Journal of Computer Science |
| Subjects: | |
| Online Access: | http://www.worldscientific.com/doi/pdf/10.1142/S2196888819500106 |
| _version_ | 1818336991139332096 |
|---|---|
| author | Kacper Petrynski Iwona Pozniak-Koszalka Leszek Koszalka Andrzej Kasprzak |
| author_facet | Kacper Petrynski Iwona Pozniak-Koszalka Leszek Koszalka Andrzej Kasprzak |
| author_sort | Kacper Petrynski |
| collection | DOAJ |
| description | 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 algorithm are studied taking into account the results of experiments made using the designed and implemented experimentation system. This system allows in tuning the parameters of the algorithm as well as to compare the effects obtained by AIT-S algorithm with effects of AIT algorithm, and known meta-heuristic algorithms. The paper shows that the proposed algorithm still requires some improvements, however, it seems to be promising. |
| first_indexed | 2024-12-13T14:48:07Z |
| format | Article |
| id | doaj.art-704c2f7ec29d45f2a1a8f693f08b93c3 |
| institution | Directory Open Access Journal |
| issn | 2196-8888 2196-8896 |
| language | English |
| last_indexed | 2024-12-13T14:48:07Z |
| publishDate | 2019-08-01 |
| publisher | World Scientific Publishing |
| record_format | Article |
| series | Vietnam Journal of Computer Science |
| spelling | doaj.art-704c2f7ec29d45f2a1a8f693f08b93c32022-12-21T23:41:25ZengWorld Scientific PublishingVietnam Journal of Computer Science2196-88882196-88962019-08-016327328410.1142/S219688881950010610.1142/S2196888819500106AIT-S for Single-Machine Weighted Tardiness ProblemKacper Petrynski0Iwona Pozniak-Koszalka1Leszek Koszalka2Andrzej Kasprzak3Department of Systems and Computer Networks, Wroclaw University of Science and Technology, Wroclaw, PolandDepartment of Systems and Computer Networks, Wroclaw University of Science and Technology, Wroclaw, PolandDepartment of Systems and Computer Networks, Wroclaw University of Science and Technology, Wroclaw, PolandDepartment of Systems and Computer Networks, Wroclaw University of Science and Technology, Wroclaw, PolandThis 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 algorithm are studied taking into account the results of experiments made using the designed and implemented experimentation system. This system allows in tuning the parameters of the algorithm as well as to compare the effects obtained by AIT-S algorithm with effects of AIT algorithm, and known meta-heuristic algorithms. The paper shows that the proposed algorithm still requires some improvements, however, it seems to be promising.http://www.worldscientific.com/doi/pdf/10.1142/S2196888819500106Algorithmtask schedulingtardinesstree structuresortingexperimentation system |
| spellingShingle | Kacper Petrynski Iwona Pozniak-Koszalka Leszek Koszalka Andrzej Kasprzak AIT-S for Single-Machine Weighted Tardiness Problem Vietnam Journal of Computer Science Algorithm task scheduling tardiness tree structure sorting experimentation system |
| title | AIT-S for Single-Machine Weighted Tardiness Problem |
| title_full | AIT-S for Single-Machine Weighted Tardiness Problem |
| title_fullStr | AIT-S for Single-Machine Weighted Tardiness Problem |
| title_full_unstemmed | AIT-S for Single-Machine Weighted Tardiness Problem |
| title_short | AIT-S for Single-Machine Weighted Tardiness Problem |
| title_sort | ait s for single machine weighted tardiness problem |
| topic | Algorithm task scheduling tardiness tree structure sorting experimentation system |
| url | http://www.worldscientific.com/doi/pdf/10.1142/S2196888819500106 |
| work_keys_str_mv | AT kacperpetrynski aitsforsinglemachineweightedtardinessproblem AT iwonapozniakkoszalka aitsforsinglemachineweightedtardinessproblem AT leszekkoszalka aitsforsinglemachineweightedtardinessproblem AT andrzejkasprzak aitsforsinglemachineweightedtardinessproblem |