메뉴 건너뛰기




Volumn 26, Issue 1, 2013, Pages 150-161

Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research

Author keywords

Ant Colony Optimization; Literature review; Scheduling problems

Indexed keywords

PROBLEM SOLVING; SCHEDULING;

EID: 84870055990     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2012.03.011     Document Type: Article
Times cited : (93)

References (70)
  • 1
    • 40649087168 scopus 로고    scopus 로고
    • Ahmadizar, F.; Barzinpour, F.; Arkat, J.; 2007. Solving permutation flow shop sequencing using ant colony optimization. In: 2007 IEEE International Conference on Industrial Engineering and Engineering Management, pp. 753-757.
    • Ahmadizar, F.; Barzinpour, F.; Arkat, J.; 2007. Solving permutation flow shop sequencing using ant colony optimization. In: 2007 IEEE International Conference on Industrial Engineering and Engineering Management, pp. 753-757.
  • 2
    • 60349093593 scopus 로고    scopus 로고
    • Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
    • A.S. Al-Anzi, and A. Allahverdi Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan Comput. Oper. Res. 36 9 2009 2682 2689
    • (2009) Comput. Oper. Res. , vol.36 , Issue.9 , pp. 2682-2689
    • Al-Anzi, A.S.1    Allahverdi, A.2
  • 3
    • 58349119006 scopus 로고    scopus 로고
    • Anghinolfi, D.; Boccalatte, A.; Paolucci, M.; Vecchiola, C.; 2008. Performance evaluation of an adaptive ant colony optimization applied to single machine scheduling. In: Simulated Evolution and Learning. Springer, Berlin/Heidelberg, pp. 411-420.
    • Anghinolfi, D.; Boccalatte, A.; Paolucci, M.; Vecchiola, C.; 2008. Performance evaluation of an adaptive ant colony optimization applied to single machine scheduling. In: Simulated Evolution and Learning. Springer, Berlin/Heidelberg, pp. 411-420.
  • 4
    • 54949097436 scopus 로고    scopus 로고
    • Arnaout, J.; Musa, R.; Rabadi, G.; 2008. Ant colony optimization algorithm to parallel machine scheduling problem with setups. In: 4th IEEE Conference on Automation Science and Engineering.
    • Arnaout, J.; Musa, R.; Rabadi, G.; 2008. Ant colony optimization algorithm to parallel machine scheduling problem with setups. In: 4th IEEE Conference on Automation Science and Engineering.
  • 5
    • 84870066438 scopus 로고    scopus 로고
    • A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times
    • J. Arnaout, G. Rabadi, and R. Musa A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times J. Intell. Manuf 2009
    • (2009) J. Intell. Manuf
    • Arnaout, J.1    Rabadi, G.2    Musa, R.3
  • 7
    • 84870960624 scopus 로고    scopus 로고
    • Bauer, A.; Bullnheimer, B.; Hartl, R.F.; Staruss, C.; 1999. Applying Ant Colony Optimization to Solve the Single Machine Total Tardiness Problem. Technical Report. Vienna University of Economics and Business Administration.
    • Bauer, A.; Bullnheimer, B.; Hartl, R.F.; Staruss, C.; 1999. Applying Ant Colony Optimization to Solve the Single Machine Total Tardiness Problem. Technical Report. Vienna University of Economics and Business Administration.
  • 8
    • 64449088021 scopus 로고    scopus 로고
    • Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm
    • J. Behnamian, M. Zandieh, and S.M.T. Fatemi Ghomi Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm Expert Syst. Appl. 36 6 2009 9637 9644
    • (2009) Expert Syst. Appl. , vol.36 , Issue.6 , pp. 9637-9644
    • Behnamian, J.1    Zandieh, M.2    Fatemi Ghomi, S.M.T.3
  • 10
    • 0033446619 scopus 로고    scopus 로고
    • An improved ant system algorithm for the vehicle routing problem
    • Brend Bullnheimer, Richard F. Hartl, and Christine Strauss An improved ant system algorithm for the vehicle routing problem Ann. Oper. Res. 89 1997 319 328
    • (1997) Ann. Oper. Res. , vol.89 , pp. 319-328
    • Bullnheimer, B.1    Hartl, R.F.2    Strauss, C.3
  • 11
    • 70349282021 scopus 로고    scopus 로고
    • Chen, R.; Lo, S.; Wu, C.; Lin, T.; 2008. An effective ant colony optimization-based algorithm for flow shop scheduling. In: IEEE Conference on Soft Computing in Industrial Applications.
    • Chen, R.; Lo, S.; Wu, C.; Lin, T.; 2008. An effective ant colony optimization-based algorithm for flow shop scheduling. In: IEEE Conference on Soft Computing in Industrial Applications.
  • 12
    • 55749107925 scopus 로고    scopus 로고
    • Cheng, B.-Y.; Chen, H.-P.; Shao, H.; Xu, R.; Huang, G.Q.; 2008. A chaotic ant colony optimization method for scheduling a single batch-processing machine with non-identical job sizes. In: IEEE Congress on Evolutionary Computation, pp. 40-43.
    • Cheng, B.-Y.; Chen, H.-P.; Shao, H.; Xu, R.; Huang, G.Q.; 2008. A chaotic ant colony optimization method for scheduling a single batch-processing machine with non-identical job sizes. In: IEEE Congress on Evolutionary Computation, pp. 40-43.
  • 13
    • 52049085837 scopus 로고    scopus 로고
    • A hybrid algorithm for the single-machine total tardiness problem
    • T.C.E. Cheng, A.A. Lazarev, and E.R. Gafarov A hybrid algorithm for the single-machine total tardiness problem Comput. Oper. Res. 36 2 2009 308 315
    • (2009) Comput. Oper. Res. , vol.36 , Issue.2 , pp. 308-315
    • Cheng, T.C.E.1    Lazarev, A.A.2    Gafarov, E.R.3
  • 14
    • 84870972009 scopus 로고    scopus 로고
    • Colorni, A.; Dorigo, M.; Maniezzo, V.; 1991. Distributed optimization by ant colonies. In: European Conference of Artificial Life, pp. 134-142.
    • Colorni, A.; Dorigo, M.; Maniezzo, V.; 1991. Distributed optimization by ant colonies. In: European Conference of Artificial Life, pp. 134-142.
  • 16
    • 84870960760 scopus 로고    scopus 로고
    • Cordon, O.; Vianna, I.F.; Herrera, F.; Moreno, L.; 2000. A new ACO model integrating evolutionary computation concepts: the best-worst ant system. In: Ants2000.
    • Cordon, O.; Vianna, I.F.; Herrera, F.; Moreno, L.; 2000. A new ACO model integrating evolutionary computation concepts: the best-worst ant system. In: Ants2000.
  • 17
    • 84947905083 scopus 로고    scopus 로고
    • den Besten, M.; Stützle, T.; Dorigo, M.; 2000. Ant colony optimization for the total weighted tardiness problem. In: PPSN VI: Proceedings of the 6th International Conference on Parallel Problem Solving from Nature. Springer-Verlag, London, UK, pp. 611-620.
    • den Besten, M.; Stützle, T.; Dorigo, M.; 2000. Ant colony optimization for the total weighted tardiness problem. In: PPSN VI: Proceedings of the 6th International Conference on Parallel Problem Solving from Nature. Springer-Verlag, London, UK, pp. 611-620.
  • 18
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to the traveling salesman problem
    • M. Dorigo, and L.M. Gambardella Ant colony system: a cooperative learning approach to the traveling salesman problem IEEE Trans. Evol. Comput. 1 1997 53 66
    • (1997) IEEE Trans. Evol. Comput. , vol.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 21
    • 15844419376 scopus 로고    scopus 로고
    • Ant colony optimization for the examination scheduling problem
    • K.A. Dowsland, and J.M. Thompson Ant colony optimization for the examination scheduling problem J. Oper. Res. Soc. 56 2005 426 438
    • (2005) J. Oper. Res. Soc. , vol.56 , pp. 426-438
    • Dowsland, K.A.1    Thompson, J.M.2
  • 22
    • 59449087081 scopus 로고    scopus 로고
    • Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems
    • V.P. Eswaramurthy, and A. Tamilarasi Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems Int. J. Adv. Manuf. Technol. 40 2009 1004 1015
    • (2009) Int. J. Adv. Manuf. Technol. , vol.40 , pp. 1004-1015
    • Eswaramurthy, V.P.1    Tamilarasi, A.2
  • 23
    • 0036682205 scopus 로고    scopus 로고
    • Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
    • C. Gagn, W.L. Price, and M. Gravel Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times J. Oper. Res. Soc. 53 2002 895 906
    • (2002) J. Oper. Res. Soc. , vol.53 , pp. 895-906
    • Gagn, C.1    Price, W.L.2    Gravel, M.3
  • 24
    • 31744439035 scopus 로고    scopus 로고
    • An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops
    • Y. Gajpal, and C. Rajendran An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops Int. J. Prod. Econ. 101 2006 259 272
    • (2006) Int. J. Prod. Econ. , vol.101 , pp. 259-272
    • Gajpal, Y.1    Rajendran, C.2
  • 25
    • 77949765219 scopus 로고    scopus 로고
    • An ACO approach for the parallel machines scheduling problem
    • C.R. Gatica, S.C. Esquivel, and G.M. Leguizamon An ACO approach for the parallel machines scheduling problem Intell. Artif. 46 2010 84 95
    • (2010) Intell. Artif. , vol.46 , pp. 84-95
    • Gatica, C.R.1    Esquivel, S.C.2    Leguizamon, G.M.3
  • 26
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic machine scheduling: A survey
    • R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G.R. Kan Optimization and approximation in deterministic machine scheduling: a survey Ann. Discrete Math. 5 1979 287 326
    • (1979) Ann. Discrete Math. , vol.5 , pp. 287-326
    • Graham, R.L.1    Lawler, E.L.2    Lenstra, J.K.3    Kan, A.H.G.R.4
  • 27
    • 33748320730 scopus 로고    scopus 로고
    • An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
    • W.J. Gutjahr, and M.S. Rauner An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria Comput. Oper. Res. 34 2007
    • (2007) Comput. Oper. Res. , vol.34
    • Gutjahr, W.J.1    Rauner, M.S.2
  • 28
    • 34247223607 scopus 로고    scopus 로고
    • Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem
    • J. Heinonen, and F. Pettersson Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem Appl. Math. Comput. 187 2007 989 998
    • (2007) Appl. Math. Comput. , vol.187 , pp. 989-998
    • Heinonen, J.1    Pettersson, F.2
  • 29
    • 22744450247 scopus 로고    scopus 로고
    • A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
    • O. Holthaus, and C. Rajendran A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs J. Oper. Res. Soc. 56 2005 947 953
    • (2005) J. Oper. Res. Soc. , vol.56 , pp. 947-953
    • Holthaus, O.1    Rajendran, C.2
  • 30
    • 34548613299 scopus 로고    scopus 로고
    • Ant colony optimization combined with taboo search for the job shop scheduling problem
    • K. Huang, and C. Liao Ant colony optimization combined with taboo search for the job shop scheduling problem Comput. Oper. Res. 35 2008 1030 1046
    • (2008) Comput. Oper. Res. , vol.35 , pp. 1030-1046
    • Huang, K.1    Liao, C.2
  • 31
    • 52649172737 scopus 로고    scopus 로고
    • Ant colony system for job shop scheduling with time windows
    • R. Huang, and C. Yang Ant colony system for job shop scheduling with time windows Int. J. Adv. Manuf. Technol. 39 2008 151 157
    • (2008) Int. J. Adv. Manuf. Technol. , vol.39 , pp. 151-157
    • Huang, R.1    Yang, C.2
  • 32
    • 67349089317 scopus 로고    scopus 로고
    • Solving a multi-objective overlapping flow-shop scheduling
    • R. Huang, and C. Yang Solving a multi-objective overlapping flow-shop scheduling Int. J. Adv. Manuf. Technol. 42 2009 955 962
    • (2009) Int. J. Adv. Manuf. Technol. , vol.42 , pp. 955-962
    • Huang, R.1    Yang, C.2
  • 33
    • 0003075019 scopus 로고
    • Optimal two- and three-stage production schedules with setup times included
    • S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Res. Log. Q. 1 1953 61 68
    • (1953) Naval Res. Log. Q. , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 34
    • 49749150530 scopus 로고    scopus 로고
    • Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
    • A.H. Kashan, and B. Karimi Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: an ant colony framework J. Oper. Res. Soc. 59 2008 1269 1280
    • (2008) J. Oper. Res. Soc. , vol.59 , pp. 1269-1280
    • Kashan, A.H.1    Karimi, B.2
  • 35
    • 38549086270 scopus 로고    scopus 로고
    • Li, J.; Zhang, W.; 2006. Solution to multi-objective optimization of flow shop problem based on ACO algorithm. In: 2006 International Conference on Computational Intelligence and Security.
    • Li, J.; Zhang, W.; 2006. Solution to multi-objective optimization of flow shop problem based on ACO algorithm. In: 2006 International Conference on Computational Intelligence and Security.
  • 36
    • 70349284999 scopus 로고    scopus 로고
    • ACO-based multi-objective scheduling of parallel batch processing machines with advanced process control constraints
    • L. Li, F. Qiao, and Q.D. Wu ACO-based multi-objective scheduling of parallel batch processing machines with advanced process control constraints Int. J. Adv. Manuf. Technol. 44 2009 985 994
    • (2009) Int. J. Adv. Manuf. Technol. , vol.44 , pp. 985-994
    • Li, L.1    Qiao, F.2    Wu, Q.D.3
  • 37
    • 56449093692 scopus 로고    scopus 로고
    • Li, L.; Quiao, F.; Wu, Q.; 2008. ACO-based scheduling of parallel batch processing machines with incompatible job families to minimize total weighted tardiness. In: Ant Colony Optimization and Swarm Intelligence. Springer, Berlin/Heidelberg, pp. 219-226.
    • Li, L.; Quiao, F.; Wu, Q.; 2008. ACO-based scheduling of parallel batch processing machines with incompatible job families to minimize total weighted tardiness. In: Ant Colony Optimization and Swarm Intelligence. Springer, Berlin/Heidelberg, pp. 219-226.
  • 38
    • 77956062164 scopus 로고    scopus 로고
    • Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic
    • X. Li, M.F. Baki, and Y.P. Aneja Flow shop scheduling to minimize the total completion time with a permanently present operator: models and ant colony optimization metaheuristic Comput. Oper. Res. 38 2011 152 164
    • (2011) Comput. Oper. Res. , vol.38 , pp. 152-164
    • Li, X.1    Baki, M.F.2    Aneja, Y.P.3
  • 39
    • 33845332680 scopus 로고    scopus 로고
    • An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
    • C.-J. Liao, and H.-C. Juan An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups Comput. Oper. Res. 34 7 2007 1899 1909
    • (2007) Comput. Oper. Res. , vol.34 , Issue.7 , pp. 1899-1909
    • Liao, C.-J.1    Juan, H.-C.2
  • 40
    • 39649117983 scopus 로고    scopus 로고
    • Development of new features of ant colony optimization for flowshop scheduling
    • URL 〈 〉
    • B. Lin, C. Lu, S. Shyu, and C. Tsai Development of new features of ant colony optimization for flowshop scheduling Int. J. Prod. Econ. 112 2 2008 742 755 URL 〈 http://ideas.repec.org/a/eee/proeco/v112y2008i2p742-755.html 〉
    • (2008) Int. J. Prod. Econ. , vol.112 , Issue.2 , pp. 742-755
    • Lin, B.1    Lu, C.2    Shyu, S.3    Tsai, C.4
  • 41
    • 58149150064 scopus 로고    scopus 로고
    • Threshold accepting and ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming
    • S. Marimuthu, S.G. Ponnambalam, and N. Jawahar Threshold accepting and ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming J. Mater. Process. Technol. 209 2009 1026 1041
    • (2009) J. Mater. Process. Technol. , vol.209 , pp. 1026-1041
    • Marimuthu, S.1    Ponnambalam, S.G.2    Jawahar, N.3
  • 42
    • 84958631637 scopus 로고    scopus 로고
    • Merkle, D.; Middendorf, M.; 2000. An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In: EvoWorkshops, pp. 287-296. URL 〈 〉.
    • Merkle, D.; Middendorf, M.; 2000. An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In: EvoWorkshops, pp. 287-296. URL 〈 citeseer.ist.psu.edu/article/merkle00ant.html 〉.
  • 43
    • 0037272238 scopus 로고    scopus 로고
    • Ant colony optimization with global pheromone evaluation for scheduling a single machine
    • D. Merkle, and M. Middendorf Ant colony optimization with global pheromone evaluation for scheduling a single machine Appl. Intell. 1 2003 105 111
    • (2003) Appl. Intell. , vol.1 , pp. 105-111
    • Merkle, D.1    Middendorf, M.2
  • 44
    • 79958830028 scopus 로고    scopus 로고
    • Ant colony optimization technique for the sequence-dependent flowshop scheduling problem
    • M. Mirabi Ant colony optimization technique for the sequence-dependent flowshop scheduling problem Int. J. Adv. Manuf. Technol. 55 2011 317 326
    • (2011) Int. J. Adv. Manuf. Technol. , vol.55 , pp. 317-326
    • Mirabi, M.1
  • 45
    • 54949148413 scopus 로고    scopus 로고
    • Monch, L.; 2008. Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines. In: IEEE International Conference on Automation Science and Engineering, 2008 (CASE 2008).
    • Monch, L.; 2008. Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines. In: IEEE International Conference on Automation Science and Engineering, 2008 (CASE 2008).
  • 46
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
    • M. Nawaz, E. Enscore, and I. Ham A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem Omega 11 1983 91 95
    • (1983) Omega , vol.11 , pp. 91-95
    • Nawaz, M.1    Enscore, E.2    Ham, I.3
  • 47
    • 33751374104 scopus 로고    scopus 로고
    • Pasia, J.M.; Hartl, R.F.; Doerner, K.F.; 2006. Solving a bi-objective flowshop scheduling problem by pareto-ant colony optimization. Lect. Notes Comput. Sci. 4150, 294-305 (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).
    • Pasia, J.M.; Hartl, R.F.; Doerner, K.F.; 2006. Solving a bi-objective flowshop scheduling problem by pareto-ant colony optimization. Lect. Notes Comput. Sci. 4150, 294-305 (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).
  • 50
    • 45149110066 scopus 로고    scopus 로고
    • Raghavan, N.R.S.; Venkataramana, M.; 2006. Scheduling parallel batch processors with incompatible job families using ant colony optimization. In: Proceeding of the 2006 IEEE International Conference on Automation Science and Engineering.
    • Raghavan, N.R.S.; Venkataramana, M.; 2006. Scheduling parallel batch processors with incompatible job families using ant colony optimization. In: Proceeding of the 2006 IEEE International Conference on Automation Science and Engineering.
  • 51
    • 1642559633 scopus 로고    scopus 로고
    • Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
    • URL 〈 〉
    • C. Rajendran, and H. Ziegler Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs Eur. J. Oper. Res. 155 2 2004 426 438 URL 〈 http://ideas.repec.org/a/eee/ejores/ v155y2004i2p426-438.html 〉
    • (2004) Eur. J. Oper. Res. , vol.155 , Issue.2 , pp. 426-438
    • Rajendran, C.1    Ziegler, H.2
  • 52
    • 15344338961 scopus 로고    scopus 로고
    • Two ant-colony algorithms for minimizing total flowtime in permutation flowshops
    • C. Rajendran, and H. Ziegler Two ant-colony algorithms for minimizing total flowtime in permutation flowshops Comput. Ind. Eng. 48 4 2005 789 797
    • (2005) Comput. Ind. Eng. , vol.48 , Issue.4 , pp. 789-797
    • Rajendran, C.1    Ziegler, H.2
  • 53
    • 33847337393 scopus 로고    scopus 로고
    • Sankar, S.S.; Ponnambalam, S.G.; Rathinavel, V.; Visveshvaren, M.S.; 2005. Scheduling in parallel machine shop: an ant colony optimization approach. In: IEEE International Conference on Industrial Technology, 2005 (ICIT 2005), pp. 276-280. URL 〈 〉.
    • Sankar, S.S.; Ponnambalam, S.G.; Rathinavel, V.; Visveshvaren, M.S.; 2005. Scheduling in parallel machine shop: an ant colony optimization approach. In: IEEE International Conference on Industrial Technology, 2005 (ICIT 2005), pp. 276-280. URL 〈 http://dx.doi.org/10.1109/ICIT.2005.1600649 〉.
  • 54
    • 80053081650 scopus 로고    scopus 로고
    • Shih-Pang, T.; Chun-Wei, T.; Jui-Le, C.; Ming-Chao, C.; Chu-Sing, Y.; 2011. Job shop scheduling based on ACO with a hybrid solution construction strategy. In: IEEE International Conference on Fuzzy Systems (FUZZ).
    • Shih-Pang, T.; Chun-Wei, T.; Jui-Le, C.; Ming-Chao, C.; Chu-Sing, Y.; 2011. Job shop scheduling based on ACO with a hybrid solution construction strategy. In: IEEE International Conference on Fuzzy Systems (FUZZ).
  • 55
    • 6344253119 scopus 로고    scopus 로고
    • Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time
    • S. Shyu, B. Lin, and P. Yin Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time Comput. Ind. Eng. 47 2004 181 193
    • (2004) Comput. Ind. Eng. , vol.47 , pp. 181-193
    • Shyu, S.1    Lin, B.2    Yin, P.3
  • 57
    • 79251639841 scopus 로고    scopus 로고
    • An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed
    • R.F. Tavares Neto, and M. Godinho Filho An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed Comput. Oper. Res. 38 2011 1286 1293
    • (2011) Comput. Oper. Res. , vol.38 , pp. 1286-1293
    • Tavares Neto, R.F.1    Godinho Filho, M.2
  • 58
    • 71049146815 scopus 로고    scopus 로고
    • Thiruvady, D.; Blum, C.; Meyer, B.; Ernst, A.; 2009. Hybridizing beam-ACO with constraint programming for single machine job scheduling. In: Lecture Notes in Computer Science. Springer Link, pp. 30-44.
    • Thiruvady, D.; Blum, C.; Meyer, B.; Ernst, A.; 2009. Hybridizing beam-ACO with constraint programming for single machine job scheduling. In: Lecture Notes in Computer Science. Springer Link, pp. 30-44.
  • 59
    • 0037120688 scopus 로고    scopus 로고
    • An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
    • V. T'kindt, N. Monmarche, F. Tercinet, and D. Laugt An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem Eur. J. Oper. Res. 142 2 2002 250 257
    • (2002) Eur. J. Oper. Res. , vol.142 , Issue.2 , pp. 250-257
    • T'Kindt, V.1    Monmarche, N.2    Tercinet, F.3    Laugt, D.4
  • 60
    • 46149109502 scopus 로고    scopus 로고
    • Multiple colony ant algorithm for job-shop scheduling problem
    • A. Udomsakdigool, and V. Kachitvichyanukul Multiple colony ant algorithm for job-shop scheduling problem Int. J. Prod. Res. 46 2008 4155 4175
    • (2008) Int. J. Prod. Res. , vol.46 , pp. 4155-4175
    • Udomsakdigool, A.1    Kachitvichyanukul, V.2
  • 61
    • 79960194636 scopus 로고    scopus 로고
    • Makespan minimization on single batch-processing machine via ant colony optimization
    • R. Xu, H. Chen, and X. Li Makespan minimization on single batch-processing machine via ant colony optimization Comput. Oper. Res. 39 2012 582 593
    • (2012) Comput. Oper. Res. , vol.39 , pp. 582-593
    • Xu, R.1    Chen, H.2    Li, X.3
  • 62
    • 38849110113 scopus 로고    scopus 로고
    • Ant colony optimization for multi-objective flow shop scheduling problem
    • B. Yagmahan, and M.M. Yenisey Ant colony optimization for multi-objective flow shop scheduling problem Comput. Ind. Eng. 54 2008 411 420
    • (2008) Comput. Ind. Eng. , vol.54 , pp. 411-420
    • Yagmahan, B.1    Yenisey, M.M.2
  • 64
    • 34249903338 scopus 로고    scopus 로고
    • Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems
    • K. Ying, and S. Lin Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems Int. J. Adv. Manuf. Technol. 33 2007 793 802
    • (2007) Int. J. Adv. Manuf. Technol. , vol.33 , pp. 793-802
    • Ying, K.1    Lin, S.2
  • 65
    • 0142258724 scopus 로고    scopus 로고
    • An ant colony system approach for scheduling problems
    • 68-75(8). URL 〈 〉
    • K.-C. Ying, and C.-J. Liao An ant colony system approach for scheduling problems Prod. Plann. Control 14 2003 68-75(8). URL 〈 http://www. ingentaconnect.com/content/tandf/tppc/2003/00000014/00000001/art00006 〉
    • (2003) Prod. Plann. Control , vol.14
    • Ying, K.-C.1    Liao, C.-J.2
  • 66
    • 34547317399 scopus 로고    scopus 로고
    • Yoshikawa, M.; Terai, H.; 2006. A hybrid ant colony optimization technique for job-shop scheduling problems. In: Proceedings of the 4th International Conference on Software Engineering Research, Management and Applications.
    • Yoshikawa, M.; Terai, H.; 2006. A hybrid ant colony optimization technique for job-shop scheduling problems. In: Proceedings of the 4th International Conference on Software Engineering Research, Management and Applications.
  • 67
    • 77956072712 scopus 로고    scopus 로고
    • Zhang, Z.; Zhang, J.; Li, S.; 2010. A modified ant colony algorithm for the job shop scheduling problem to minimize makespan. In: International Conference on Mechanic Automation and Control Engineering (MACE).
    • Zhang, Z.; Zhang, J.; Li, S.; 2010. A modified ant colony algorithm for the job shop scheduling problem to minimize makespan. In: International Conference on Mechanic Automation and Control Engineering (MACE).
  • 68
    • 40649110126 scopus 로고    scopus 로고
    • Zhou, H.; Li, Z.; Wu, X.; 2007. Scheduling unrelated parallel machine to minimize total weighted tardiness using ant colony optimization. In: IEEE International Conference on Automation and Logistics.
    • Zhou, H.; Li, Z.; Wu, X.; 2007. Scheduling unrelated parallel machine to minimize total weighted tardiness using ant colony optimization. In: IEEE International Conference on Automation and Logistics.
  • 69
    • 70450067455 scopus 로고    scopus 로고
    • Zhou, P.; Qingshan, D.; 2009. Hybridizing fast taboo search with ant colony optimization algorithm for solving large scale permutation flow shop scheduling problem. In: IEEE International Conference on Granular Computing.
    • Zhou, P.; Qingshan, D.; 2009. Hybridizing fast taboo search with ant colony optimization algorithm for solving large scale permutation flow shop scheduling problem. In: IEEE International Conference on Granular Computing.
  • 70
    • 77956077156 scopus 로고    scopus 로고
    • Zhuo, X.; Zhang, J.; Chen, W.; 2007. A new pheromone design in ACS for solving JSP. In: IEEE Congress on Evolutionary Computation.
    • Zhuo, X.; Zhang, J.; Chen, W.; 2007. A new pheromone design in ACS for solving JSP. In: IEEE Congress on Evolutionary Computation.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.