Single Machine Weighted Tardiness Problem: An Algorithm and Experimentation System

Petrynski, Kacper; Szost, Robert; Pozniak-Koszalka, Iwona; Koszalka, Leszek; Kasprzak, Andrzej

doi:10.1007/978-3-319-98446-9_4

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

2021

Publication Types

Select...

Article2

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3 This work is the extension Ref. 4 in which we proposed a heuristic algorithm based on binary tree structure called Algorithm Inspired by Tree (AIT). The properties of the AIT algorithm had been studied on the basis of the results of simulation experiments made with the designed experimentation system.…”

Section: Introductionmentioning

confidence: 99%

AIT-S for Single-Machine Weighted Tardiness Problem

Petrynski

Pozniak-Koszalka

Koszalka

et al. 2019

Vietnam J. Comp. Sci.

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%