 No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespanAli Allahverdi, Harun Aydilek and Asiye Aydilek Applied Mathematics and Computation, 2020, vol. 365, issue C Abstract: The no-wait flowshop scheduling problem on m machines with separate setup times is addressed to minimize total tardiness with an upper bound on makespan. Conditions for a dominance rule are established. Then, a new simulated annealing algorithm utilizing block insertion and block exchange operators is proposed, which we call a block simulated annealing algorithm. The proposed block simulated annealing algorithm is combined with an iterated search algorithm where the block simulated annealing algorithm explores the search space for a smaller total tardiness while the iterated search algorithm satisfies the constraint on the makespan. The proposed combined algorithm is called PA. Moreover, six closely related and well performing algorithms in the literature are modified to the problem, and PA is compared with these six algorithms. Extensive computational experiments reveal that PA reduces the error of the best modified algorithm by more than 50% for the same CPU times. Furthermore, the results are statistically tested, and thus, PA is recommended. Keywords: Setup times; No-wait flowshop; Total tardiness; Makespan; Scheduling (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:365:y:2020:i:c:s0096300319306800 DOI: 10.1016/j.amc.2019.124688 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.