An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
Sign Up to like & getrecommendations! Published in 2020 at "Engineering Optimization"
DOI: 10.1080/0305215x.2020.1797000
Abstract: This article addresses the m-machine no-wait flowshop scheduling problem with the objective of minimizing makespan subject to an upper bound on total completion time. An iterated greedy-with-local-search algorithm is proposed and compared with a mathematical… read more here.
Keywords: time; makespan subject; problem; flowshop scheduling ... See more keywords