Simulated annealing algorithms to minimise the completion time variance of jobs in permutation flowshops
Sign Up to like & getrecommendations! Published in 2019 at "International Journal of Industrial and Systems Engineering"
DOI: 10.1504/ijise.2019.10020534
Abstract: In this paper, the permutation flowshop scheduling problem with the objective of minimising the completion time variance (CTV) of jobs is considered, and a simulated annealing algorithm (SA) and two modified SAs (MSA1 and MSA2)… read more here.
Keywords: time; completion; time variance; permutation ... See more keywords
A two-phase simulated annealing algorithm to minimise the completion time variance of jobs in flowshops
Sign Up to like & getrecommendations! Published in 2020 at "International Journal of Process Management and Benchmarking"
DOI: 10.1504/ijpmb.2020.10026949
Abstract: In this paper, simulated annealing (SA) algorithm is employed to solve the flowshop scheduling problem with the objective of minimising the completion time variance (CTV) of jobs. Four variants of the two-phase SA algorithm (SA-I… read more here.
Keywords: time variance; annealing algorithm; completion; completion time ... See more keywords