Robustness of the Uncertain Single Machine Total Weighted Tardiness Problem with Elimination Criteria Applied

2018 ◽  
pp. 94-103 ◽  
Author(s):  
Wojciech Bożejko ◽  
Paweł Rajba ◽  
Mieczysław Wodecki
Keyword(s):  
Single Machine ◽  
Total Weighted Tardiness ◽  
Weighted Tardiness

scholarly journals Stable scheduling of single machine with probabilistic parameters

2017 ◽  
Vol 65 (2) ◽  
pp. 219-231 ◽  
Author(s):  
W. Bożejko ◽  
P. Rajba ◽  
M. Wodecki
Keyword(s):  
Tabu Search ◽  
Single Machine ◽  
Random Variables ◽  
Global Optimum ◽  
Total Weighted Tardiness ◽  
Independent Random Variables ◽  
Stochastic Version ◽  
Weighted Tardiness ◽  
Deterministic Problem ◽  
Erlang Distributions

Abstract We consider a stochastic variant of the single machine total weighted tardiness problem jobs parameters are independent random variables with normal or Erlang distributions. Since even deterministic problem is NP-hard, it is difficult to find global optimum for large instances in the reasonable run time. Therefore, we propose tabu search metaheuristics in this work. Computational experiments show that solutions obtained by the stochastic version of metaheuristics are more stable (i.e. resistant to data disturbance) than solutions generated by classic, deterministic version of the algorithm.

Sign in / Sign up

Export Citation Format

Share Document