Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1703445 | Applied Mathematical Modelling | 2014 | 12 Pages |
Abstract
In this paper, we consider a permutation flowshop scheduling problem with deteriorating jobs. The objective is to minimize the total tardiness of all jobs. A branch-and-bound algorithm incorporating with a dominance property and a lower bound is developed. Furthermore, two metaheuristic algorithms, the simulated annealing algorithm, and the particle swarm optimization method, are proposed. Finally, computational studies are given.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Wen-Chiung Lee, Wei-Chang Yeh, Yu-Hsiang Chung,