메뉴 건너뛰기




Volumn 14, Issue 46, 2010, Pages 84-95

An ACO approach for the parallel machines scheduling problem

Author keywords

Ant colony optimization algorithms; Maximum tardiness; Parallel machine scheduling; Specific heuristic problem information

Indexed keywords

ALLOCATION RULE; ANT COLONY OPTIMIZATION ALGORITHMS; ANT-COLONY OPTIMIZATION; BASIC MODELS; CONSTRUCTION PROCESS; IDENTICAL MACHINES; MAXIMUM TARDINESS; METAHEURISTIC; PARALLEL MACHINE SCHEDULING; PARALLEL MACHINES SCHEDULING PROBLEM; RESOURCE AVAILABILITY; SCHEDULING PROBLEM; SIMPLE GENETIC ALGORITHM;

EID: 77949765219     PISSN: 11373601     EISSN: None     Source Type: Journal    
DOI: 10.4114/ia.v14i46.1550     Document Type: Article
Times cited : (2)

References (22)
  • 3
    • 33745172509 scopus 로고    scopus 로고
    • An aco-based approach for scheduling task graphs with communication costs
    • Markus Bank and Udo Honing. An aco-based approach for scheduling task graphs with communication costs. International Conference on Parallel Processing, pages 623-629, 2005.
    • (2005) International Conference On Parallel Processing , pp. 623-629
    • Bank, M.1    Honing, U.2
  • 4
    • 28644443263 scopus 로고    scopus 로고
    • An ant colony optimization approach for the single machine total tardiness problem
    • A. Bauer, B. Bernd, R. Hartl, and C. Strauss. An ant colony optimization approach for the single machine total tardiness problem. IEEE, pages 1445-1450, 1999.
    • (1999) IEEE , pp. 1445-1450
    • Bauer, A.1    Bernd, B.2    Hartl, R.3    Strauss, C.4
  • 6
    • 0032641373 scopus 로고    scopus 로고
    • A column generation based decomposition algorithm for a parallel machines just-in-time scheduling problem
    • Zhi-Long Chen and Warren B. Powell. A column generation based decomposition algorithm for a parallel machines just-in-time scheduling problem. Elseiver European of Operational Research, 1999.
    • (1999) Elseiver European of Operational Research
    • Chen, Z.-L.1    Powell, W.B.2
  • 7
    • 0031340781 scopus 로고    scopus 로고
    • Parallel machines scheduling problem using memetic algorithms
    • Runwei Cheng and Mitsuo Gen. Parallel machines scheduling problem using memetic algorithms. Elseiver Science, 33(3-4):761-764, 1997.
    • Elseiver Science , vol.33 , Issue.3-4 , pp. 761-764
    • Cheng, R.1    Gen, M.2
  • 8
    • 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 Transaction Evolutionary Comput., 1(1):53-66, 1997.
    • (1997) IEEE Transaction Evolutionary Comput , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 10
    • 77949669083 scopus 로고    scopus 로고
    • A comparison of simple and multirecombinated evolutionary algorithms with and without problem specific knowledge insertion, for parrallel machines scheduling
    • E. Ferretti and S. Esquivel. A comparison of simple and multirecombinated evolutionary algorithms with and without problem specific knowledge insertion, for parrallel machines scheduling. International Transaction on Computer Science and Engineering, 3(1):207-221, 2005.
    • (2005) International Transaction On Computer Science and Engineering , vol.3 , Issue.1 , pp. 207-221
    • Ferretti, E.1    Esquivel, S.2
  • 11
    • 27144530613 scopus 로고    scopus 로고
    • An efficient approach of simple and multirecombinated genetic algorithms for parallel machine scheduling
    • Scotland, UK, September 2005. IEEE Center
    • E. Ferretti and S. Esquivel. An efficient approach of simple and multirecombinated genetic algorithms for parallel machine scheduling. In IEEE Congress on Evolutionary Computation, volume 2, pages 1340-1347, Scotland, UK, September 2005. IEEE Center.
    • In IEEE Congress On Evolutionary Computation , vol.2 , pp. 1340-1347
    • Ferretti, E.1    Esquivel, S.2
  • 12
    • 32444450173 scopus 로고    scopus 로고
    • Knowledge insertion: An efficient approach to simple genetic algorithms for unrestricted for parallel equal machines scheduling
    • Washington DC, USA
    • E. Ferretti and S. Esquivel. Knowledge insertion: An efficient approach to simple genetic algorithms for unrestricted for parallel equal machines scheduling. In GECCO'05, pages 1587-1588, Washington DC, USA, 2005.
    • (2005) Gecco'05 , pp. 1587-1588
    • Ferretti, E.1    Esquivel, S.2
  • 13
    • 44649197067 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. Applied Mathematics and Computation, 2006.
    • (2006) Applied Mathematics and Computation
    • Heinonen, J.1    Pettersson, F.2
  • 15
    • 0001631336 scopus 로고    scopus 로고
    • Evolving ant colony optimization
    • Botee M. Hozefa and Eric Bonabeau. Evolving ant colony optimization. Complex Systems, pages 149-159, 1998.
    • (1998) Complex Systems , pp. 149-159
    • Hozefa, B.M.1    Bonabeau, E.2
  • 16
    • 0000438412 scopus 로고
    • Approximations algorithms for scheduling unrelated parallel machines
    • Jan Karel Lenstra, David B. Shmoys, and Éva Tardos. Approximations algorithms for scheduling unrelated parallel machines. Springer Berlin Heidelberg, 46(1-3):259-271, 1990.
    • (1990) Springer Berlin Heidelberg , vol.46 , Issue.1-3 , pp. 259-271
    • Lenstra, J.K.1    Shmoys, D.B.2    Tardos, E.3
  • 21
    • 1642559633 scopus 로고    scopus 로고
    • Ant colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
    • Chandrasekharan Rajendran and Hans Ziegler. Ant colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research, pages 426-438, 2004.
    • (2004) European Journal of Operational Research , pp. 426-438
    • Rajendran, C.1    Ziegler, H.2


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