Loading...
Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem
Arabameri, S ; Sharif University of Technology | 2013
498
Viewed
- Type of Document: Article
- DOI: 10.1016/j.cie.2012.12.023
- Publisher: 2013
- Abstract:
- 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 Fm|nwt, S ijk|∑wj'Ej+wj ″Tj, 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
- Keywords:
- Metaheuristic algorithms ; No-wait flowshop scheduling ; Sequence-dependent setup times ; Timing algorithm ; Meta heuristic algorithm ; Mixed integer linear programming ; No-wait flowshop ; Sequence-dependent setup time ; Timing algorithms ; Weighted earliness and tardiness ; Algorithms ; Particle swarm optimization (PSO) ; Scheduling ; Tabu search ; Problem solving
- Source: Computers and Industrial Engineering ; Volume 64, Issue 4 , April , 2013 , Pages 902-916 ; 03608352 (ISSN)
- URL: http://www.sciencedirect.com/science/article/pii/S0360835213000065