摘要
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.
学科与关键词
- Total completion time with makespan constraint in no-wait flowshops with setup timesAllahverdi, Ali*; Aydilek, HarunEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 238(3): 724-734.被引 32
- An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardinessNaderi, B.; Zandieh, M.*; Balagh, A. Khaleghi Ghoshe; Roshanaei, V.EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36(6): 9625-9633.被引 142
- Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardinessNaderi, B.; Zandieh, M.*; Roshanaei, V.INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 41(11-12): 1186-1198.被引 85
