A worm optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times
Sign Up to like & getrecommendations! Published in 2020 at "Annals of Operations Research"
DOI: 10.1007/s10479-019-03138-w
Abstract: This paper addresses the unrelated parallel machine scheduling problem with setup times, with an objective of minimizing the makespan. The machines are unrelated in the sense that the processing speed depends on the job being… read more here.
Keywords: worm optimization; dependent setup; setup times; unrelated parallel ... See more keywords
Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times
Sign Up to like & getrecommendations! Published in 2022 at "Journal of the Operational Research Society"
DOI: 10.1080/01605682.2022.2039569
Abstract: Abstract We propose four algorithms for the no-wait flow shop scheduling problem. The objective is minimizing total completion time such that makespan is not greater than a maximum value. We address the problem with sequence-dependent… read more here.
Keywords: wait flow; completion time; sequence dependent; setup times ... See more keywords
Symbiotic organisms search algorithm for the unrelated parallel machines scheduling with sequence-dependent setup times
Sign Up to like & getrecommendations! Published in 2018 at "PLoS ONE"
DOI: 10.1371/journal.pone.0200030
Abstract: This paper addresses the problem of makespan minimization on unrelated parallel machines with sequence dependent setup times. The symbiotic organisms search (SOS) algorithm is a new and popular global optimization technique that has received wide… read more here.
Keywords: machine; sos algorithm; parallel machines; unrelated parallel ... See more keywords