Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times

Journal of the Operational Research Society

Volumn 53, Issue 8, 2002, Pages 895-906

  Gagne C ^a   Price, W L ^b   Gravel, M ^a  

^a UNIVERSITÉ DU QUÉBEC À CHICOUTIMI   (Canada)

^b UNIVERSITÉ LAVAL   (Canada)

Author keywords

Ant colony optimization; Metaheuristic; Scheduling; Sequence dependent setups; Single machine; Total tardiness

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

ANT COLONY OPTIMIZATION (ACO);

OPERATIONS RESEARCH;

EID: 0036682205     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601390     Document Type: Article

References (37)

1. Addressing the gap in scheduling research: A review of optimization and heuristic methods in production scheduling
2. Unifying the theory and practice of production scheduling
3. Scheduling jobs in a Alcan aluminium factory using a genetic algorithm
4. Scheduling continuous casting of aluminum using a multiple-objective ant colony optimization metaheuristic
5. Distributed optimization by ant-colonies
6. A comparison of four methods for minimizing total tardiness on a single processor with sequence-dependent setup times
7. Minimizing total tardiness on one machine is NP-hard
8. A survey of U.S. manufacturing practices in make-to-order machine shops
9. The total tardiness problem: Review and extensions
10. One-machine sequencing to minimize certain functions of job tardiness
11. A "pseudopolynomial" algorithm for sequencing jobs to minimize total tardiness
12. An ant colony optimization approach for the single machine total tardiness problem
13. Ant colony optimization for the total weighted tardiness problem
14. An ant algorithm with new pheromone evaluation rule for the total tardiness problem
15. Scheduling in a sequence dependent setup environment with genetic search
16. The influence of setup time on job performance
17. Managing capacity: Getting the most from your firms assets
18. A saving index heuristic algorithm for flowshop scheduling with sequence dependent set-up times
19. A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times
20. A review of scheduling research involving setup considerations
21. Survey of scheduling research involving setup times
22. A heuristic to minimize the total weighted tardiness with sequence dependent setups
23. Minimizing tardiness on a single processor with sequence-dependent setup times: A simulated annealing approach
24. Probabilistic behaviour in ants: A strategy of errors?
25. Ant colonies for the traveling salesman problem
26. Local search for the asymmetric traveling salesman problem
27. Ant system: Optimization by a colony of cooperating agents
28. Ant algorithms for discrete optimization
29. An ACO algorithm for the shortest common supersequence problem
30. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
31. Rank transformations as a bridge between parametric and nonparametric statistics