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: | Kacper Petrynski, Iwona Pozniak-Koszalka, Leszek Koszalka, Andrzej Kasprzak |
---|---|
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 |
Similar Items
-
Minimizing Tardiness Penalty Costs in Job Shop Scheduling Under Maximum Allowable Tardiness
by: Jae-Gon Kim, et al.
Published: (2020-11-01) -
Minimizing total weighted tardiness for the single machine scheduling problem with dependent setup time and precedence constraints
by: Hamidreza Haddad, et al.
Published: (2012-04-01) -
A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems
by: Chia-Shin Chung, et al.
Published: (2012-01-01) -
Penjadwalan Untuk Memininimalkan Total Tardiness Dengan Metode Integer Linear Programming
by: Clara Yessica Livia, et al.
Published: (2017-09-01) -
Minimal Total Weighted Tardiness in Tight-Tardy Single Machine Preemptive Idling-Free Scheduling
by: Romanuke Vadim
Published: (2019-12-01)