Ant colony optimisation with parameterised search space for the job shop scheduling problem

International Journal of Production Research

Volumn 48, Issue 4, 2010, Pages 1143-1154

  Seo, Minseok ^a   Kim, Daecheol ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b Hanyang University   (South Korea)

Author keywords

Ant colony optimisation; Disjunctive graph; Job shop scheduling; Makespan; NP hard

Indexed keywords

ANT ALGORITHMS; ANT COLONIES; ANT COLONY OPTIMISATION; BENCH-MARK PROBLEMS; COMBINATORIAL OPTIMISATION; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; MAKESPAN; MEAN RELATIVE ERROR; META HEURISTIC ALGORITHM; NP-HARD; OPTIMAL SOLUTIONS; SEARCH SPACES; SPATIAL COMPLEXITY;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMAL SYSTEMS; PACKET NETWORKS;

SCHEDULING ALGORITHMS;

EID: 74549198723     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802538021     Document Type: Article

References (28)

1. Baker, K.R., 1974. Introduction to sequencing and scheduling. New York: John Wiley. Balas, E., 1969. Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operation Research, 17 (6), 941-957.
2. Beasley, J.E., 1990. OR-library: distributing test problems by electronic mail. Journal of the Operational Research Society, 41 (11), 1069-1072.
3. Chang, Y.L., Sueyoshi, T., and Sullivan, R.S., 1996. Ranking dispatching rules by data envelopment analysis in a job shop environment. IIE Transactions, 28 (8), 631-642.
4. Cheng, R., Gen, M., and Tsujimura, Y., 1999. A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. hybrid genetic search strategies. Computers & Industrial Engineering, 37 (1/2), 51-55.
5. Colorni, A., et al., 1994. Ant system for job-shop scheduling. Belgian Journal of Operations Research, Statistics and Computer Science, 34 (1), 39-53.
6. Dorigo, M., 1992. Optimization, learning and natural algorithms (in Italian). Thesis (PhD), Politecnico di Milano, IT.
7. Dorigo, M., Maniezzo, V., and Colorni, A., 1996. Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics, 26 (2), 29-41.
8. Dorigo, M. and Gambardella, L.M., 1997. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1 (1), 53-66.
9. Dorigo, M., Caro, G.D., and Gambardella, L.M., 1999. Ant algorithms for discrete optimization. Artificial Life, 5 (2), 137-172.
10. Dorigo, M. and Blum, C., 2005. Ant colony optimization theory: a survey. Theoretical Computer Science, 344 (2-3), 243-278.
11. Fox, B., Xiang, W., and Lee, H.P., 2007. Industrial Applications of the Ant Colony Optimisation Algorithm. The International Journal of Advanced Manufacturing Technology, 31 (7-8), 805-814.
12. Garey, M.R. and Johnson, D.S., 1979. Computers and intractability: a guide to theory of NP-completeness. New York: Freeman.
13. Giffler, B. and Thompson, G.L., 1960. Algorithms for solving production scheduling problems. Operations Research, 8 (4), 487-503.
14. Huang, K.-L. and Liao, C.-J., 2008. Ant colony optimization combined with taboo search for the job shop scheduling problem. Computers & Operations Research, 35 (4), 1030-1046.
15. Nowicki, E. and Smutnicki, C., 1996. Fast taboo search algorithm for the job shop problem. Management Science, 42 (6), 797-813.
16. Ombuki, B.M. and Ventresca, M., 2004. Local search genetic algorithms for the job shop scheduling problem. Applied Intelligence, 21 (1), 99-109.
17. Pinedo, M., 1995. Scheduling: Theory, algorithms, and systems. Upper Saddle River, NJ: Prentice Hall.
18. Ponnambalam, S.G., Jawahar, N., and Aravindan, P., 1999. A simulated annealing algorithm for job shop scheduling. Production Planning & Control, 10 (8), 767-777.
19. Ponnambalam, S.G., Aravindan, P., and Rajesh, S.V., 2000. A tabu search algorithm for job shop scheduling. International Journal of Advanced Manufacturing Technology, 16 (10), 765-771.
20. Roy, B. and Sussmann, B., 1964. Les problemes d'ordonnanacement avec constraintes disjonctives. Note DS, No. 9 bis, SEMA, Montrouge.
21. Satake, T., et al., 1999. Simulated annealing approach for minimising the makespan of the general job-shop. International Journal of Production Economics, 60 (1), 515-522.
22. Steinhofel, K., Albrecht, A., and Wong, C.K., 1999. Two simulated annealing-based heuristics for the job shop scheduling problem. European Journal of Operational Research, 118 (3), 524-548.
23. Storer, R.H., Wu, S.D., and Vaccari, R., 1992. New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38 (10), 1495-1509.
24. Udomsakdigoodl, A. and Kachitvichyanukul, V., 2008. Multiple colony ant algorithm for job-shop scheduling problem. International Journal of Production Research, 46 (15), 4155-4175.
25. Watson, J.-P., et al., 2003. Problem difficulty for tabu search in job-shop scheduling. Artificial Intelligence, 143 (2), 189-217.
26. Werner, F. and Winkler, A., 1995. Insertion techniques for the heuristic solution of the job shop problem. Discrete Applied Mathematics, 58 (2), 191-211.
27. Xia, W. and Wu, Z., 2005. An effective hybrid optimisation approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering, 48 (2), 409-425.
28. Yun, Y.S., 2002. Genetic algorithm with fuzzy logic controller for preemptive and non-preemptive job-shop scheduling problems. Computers & Industrial Engineering, 43 (3), 623-644.