The Three-Machine No-Wait Flow Shop is NP-Complete
Journal of the ACM (JACM)
An improved earliness-tardiness timing algorithm
Computers and Operations Research
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
Computers and Operations Research
A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups
Computers and Operations Research
| Hi-index | 0.00 |
In this research, the no-wait flowshop sequence-dependent setup time scheduling problem with minimization of weighted earliness and tardiness penalties as the criterion, typically classified as F"m|nwt,S"i"j"k|@?w"j^'E"j+w"j^''T"j, is investigated. A mixed integer linear programming model for the research problem is proposed. As the problem is shown to be strongly NP-hard, several metaheuristic algorithms based on tabu search (TS) and particle swarm optimization (PSO) algorithms are developed to heuristically solve the problem. A timing algorithm is generated to find the optimal schedule and calculate the objective function value of a given sequence. In order to compare the performance of the proposed algorithms, random test problems are generated and solved by all metaheuristic algorithms. Computational results show that the PSO algorithm has better performance than TS algorithm especially for the large sized problems.