Abstract
This paper deals with the NP-hard single-machine total weighted tardiness problem with sequence dependent setup times. Incorporating fuzzy sets and genetic operators, a novel ant colony optimization algorithm is developed for the problem. In the proposed algorithm, artificial ants construct solutions as orders of jobs based on the heuristic information as well as pheromone trails. To calculate the heuristic information, three well-known priority rules are adopted as fuzzy sets and then aggregated. When all artificial ants have terminated their constructions, genetic operators such as crossover and mutation are applied to generate new regions of the solution space. A local search is then performed to improve the performance quality of some of the solutions found. Moreover, at run-time the pheromone trails are locally as well as globally updated, and limited between lower and upper bounds. The proposed algorithm is experimented on a set of benchmark problems from the literature and compared with other metaheuristics.
Article PDF
Avoid common mistakes on your manuscript.
References
E. L. Lawler, A ‘pseudo polynomial’ algorithm for sequencing jobs to minimize total tardiness, Ann. Discrete Math. 1 (1977) 331–342.
Y. H. Lee, K. Bhaskaram and M. Pinedo, A heuristic to minimize the total weighted tardiness with sequence-dependent setups, IIE Trans. 29 (1997) 45–52.
V. A. Cicirello and S. F. Smith, Enhancing stochastic search performance by value-based randomization of heuristics, J. Heuristics 11 (2005) 5–34.
J. M. S. Valente and R. A. F. S. Alves, Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence dependent setups, Comput. Oper. Res. 35 (2008) 2388–2405.
S. W. Lin and K. C. Ying, Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics, Int. J. Adv. Manuf. Tech. 34 (2007) 1183–1190.
C.J. Liao and H. C. Juan, An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups, Comput. Oper. Res. 34 (2007) 1899–1909.
D. Anghinolfi and M. Paolucci, A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem, Int. J. Oper. Res. 5 (2008) 44–60.
D. Anghinolfi and M. Paolucci, A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times, Eur. J. Oper. Res. 193 (2009) 73–85.
M. F. Tasgetiren, Q. K. Pan and Y. C. Liang, A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times, Comput. Oper. Res. 36 (2009) 1900–1915.
L. Y. Tseng and S. C. Chen, A hybrid metaheuristic for the resource-constrained project scheduling problem, Eur. J. Oper. Res. 175 (2006) 707–721.
Z. J. Lee, S. F. Su, C. C. Chuang and K. H. Liu, Genetic algorithm with ant colony optimization (GA–ACO) for multiple sequence alignment, Appl. Soft Comput. 8 (2008) 55–78.
G. H. Hajimirsadeghi, M. Nabaee and B. N. Araabi, Ant colony optimization with a genetic restart approach toward global optimization, in Communications in Computer and Information Science 6, eds. H. Sarbazi-Azad et al. (Springer-Verlag, Berlin Heidelberg, 2008), pp. 9–16.
T. Kolasa and D. Król, ACO–GA approach to paper-reviewer assignment problem in CMS, in Lecture Notes in Computer Science 6071, eds. P. Jedrzejowicz et al. (Springer-Verlag, Berlin Heidelberg, 2010), pp. 360–369.
X. M. You, S. Liu and Y. M. Wang, Quantum dynamic mechanism-based parallel ant colony optimization algorithm, Int. J. Comput. Int. Sys. 3 (2010) 101–113.
F. Ahmadizar and F. Barzinpour, A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem, Int. J. Comput. Int. Sys. 3(6) (2010) 853–861.
T. Stützle and H. H. Hoos, Max-Min ant system, Future Gener. Comp. Sy. 16 (2000) 889–914.
M. Pinedo, Scheduling: Theory, Algorithms, and Systems (Prentice-Hall, Englewood Cliffs, NJ, 1995).
M. Dorigo and L. M. Gambardella, Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE T. Evolut. Comput. 1 (1997) 53–66.
F. D. Chou, An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem, Expert. Syst. Appl. 36 (2009) 3857–3865.
F. Ahmadizar, M. Ghazanfari and S.M.T. Fatemi Ghomi, Group shops scheduling with makespan criterion subject to random release dates and processing times, Comput. Oper. Res. 37 (2010) 152–162.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
This is an open access article distributed under the CC BY-NC license (https://doi.org/creativecommons.org/licenses/by-nc/4.0/).
About this article
Cite this article
Ahmadizar, F., Hosseini, L. A Novel Ant Colony Algorithm for the Single-Machine Total Weighted Tardiness Problem with Sequence Dependent Setup Times. Int J Comput Intell Syst 4, 456–466 (2011). https://doi.org/10.2991/ijcis.2011.4.4.5
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.2991/ijcis.2011.4.4.5