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...

Full description

Saved in:
Bibliographic Details
Published inVietnam journal of computer science Vol. 6; no. 3; pp. 273 - 284
Main Authors Petrynski, Kacper, Pozniak-Koszalka, Iwona, Koszalka, Leszek, Kasprzak, Andrzej
Format Journal Article
LanguageEnglish
Published World Scientific Publishing Company 01.08.2019
World Scientific Publishing
Subjects
Algorithm
experimentation system
sorting
tardiness
task scheduling
tree structure
task scheduling
tardiness
tree structure
Algorithm
sorting
experimentation system
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2196-8888
2196-8896
DOI:10.1142/S2196888819500106