메뉴 건너뛰기




Volumn 1, Issue , 2002, Pages 920-925

Makespan minimization on parallel processors: An immune-based approach

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; IMMUNE SYSTEM; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS;

EID: 84901436902     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2002.1007048     Document Type: Conference Paper
Times cited : (29)

References (24)
  • 2
    • 0016080006 scopus 로고
    • Scheduling independent tasks to reduce mean finishing time
    • J. Bruno, E.G. Coffman, and R. Sethi, "Scheduling independent tasks to reduce mean finishing time", Communications of the ACM, vol. 17(7), pp. 382-387, 1974.
    • (1974) Communications of the ACM , vol.17 , Issue.7 , pp. 382-387
    • Bruno, J.1    Coffman, E.G.2    Sethi, R.3
  • 3
    • 0014477093 scopus 로고
    • Bounds on multiprocessing timing anomalies
    • R. L. Graham, "Bounds on multiprocessing timing anomalies", SIAM J.Applied Mathematics, vol. 17, pp. 416-429, 1969.
    • (1969) SIAM J.Applied Mathematics , vol.17 , pp. 416-429
    • Graham, R.L.1
  • 4
    • 0001923235 scopus 로고
    • An application of bin-packing to multiprocessor scheduling
    • E. G. Coffman, M. R. Garey, and D.S. Johnson, "An application of bin-packing to multiprocessor scheduling", SIAM J. Comput., vol. 7, pp. 1-17, 1978.
    • (1978) SIAM J. Comput. , vol.7 , pp. 1-17
    • Coffman, E.G.1    Garey, M.R.2    Johnson, D.S.3
  • 5
    • 0024051185 scopus 로고
    • Multiprocessor scheduling combining LPT and multifit
    • C. Lee and J. D. Massey, "Multiprocessor scheduling combining LPT and multifit", Discrete Applied Mathematics, vol. 20, pp. 233-242, 1988.
    • (1988) Discrete Applied Mathematics , vol.20 , pp. 233-242
    • Lee, C.1    Massey, J.D.2
  • 6
    • 84977404156 scopus 로고
    • Makespan minimization for m parallel identical processors
    • J.C.Ho and J.S.Wong, "Makespan minimization for m parallel identical processors", Naval Research Logistics, vol. 42, pp. 935-948, 1995.
    • (1995) Naval Research Logistics , vol.42 , pp. 935-948
    • Ho, J.C.1    Wong, J.S.2
  • 7
    • 0019696911 scopus 로고    scopus 로고
    • An improved heuristic for minimizing makespan among m identical parallel processors
    • J.H. Blackstone Jr., "An improved heuristic for minimizing makespan among m identical parallel processors", Comp, and Indust. Engn, vol. 5, pp. 279-287, 1996.
    • (1996) Comp, and Indust. Engn , vol.5 , pp. 279-287
    • Blackstone Jr., J.H.1
  • 8
    • 0028374440 scopus 로고
    • A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
    • P.M. Franca, M. Gendreau, G. Laporte, and F.M. Muller, "A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective", Computers & Operations Research, vol. 21(2), pp. 205-210, 1994.
    • (1994) Computers & Operations Research , vol.21 , Issue.2 , pp. 205-210
    • Franca, P.M.1    Gendreau, M.2    Laporte, G.3    Muller, F.M.4
  • 9
    • 0030295335 scopus 로고    scopus 로고
    • A local search heuristics for unrelated parallel machine scheduling with efficient neighborhood search
    • N. Piersma and W. V. Dijk, "A local search heuristics for unrelated parallel machine scheduling with efficient neighborhood search", Mathematic Comput. Modelling, vol. 24, pp. 11-19, 1996.
    • (1996) Mathematic Comput. Modelling , vol.24 , pp. 11-19
    • Piersma, N.1    Dijk, W.V.2
  • 10
    • 0033349136 scopus 로고    scopus 로고
    • A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines
    • L. Min and W. Cheng, "A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines", Artificial Intelligence in Engendering, vol. 13, pp. 399-403, 1999.
    • (1999) Artificial Intelligence in Engendering , vol.13 , pp. 399-403
    • Min, L.1    Cheng, W.2
  • 11
    • 0031340781 scopus 로고    scopus 로고
    • Parallel machine scheduling problems using memetic algorithms
    • R. Cheng and M. Gen, "Parallel machine scheduling problems using memetic algorithms", Comp, and Indust. Engn, vol. 33, pp. 761-764, 1997.
    • (1997) Comp, and Indust. Engn , vol.33 , pp. 761-764
    • Cheng, R.1    Gen, M.2
  • 13
    • 0002467033 scopus 로고    scopus 로고
    • Architecture for an artificial immune system
    • S. A. Hofmeyer and S. Forrest, "Architecture for an artificial immune system", Evolutionary Computation, vol. 7(1), pp. 45-68, 2000.
    • (2000) Evolutionary Computation , vol.7 , Issue.1 , pp. 45-68
    • Hofmeyer, S.A.1    Forrest, S.2
  • 15
    • 0031648130 scopus 로고    scopus 로고
    • Producing robust schedules via an artificial immune system
    • E. Hart, P. Ross, and J. Nelson, "Producing robust schedules via an artificial immune system", ICEC, pp. 464-469, 1998.
    • (1998) ICEC , pp. 464-469
    • Hart, E.1    Ross, P.2    Nelson, J.3
  • 18
    • 0031521417 scopus 로고    scopus 로고
    • Minimizing tardiness on a single processor with sequence-dependent setup times: A simulated annealing approach
    • K. C. Tan and R Narasimhan, "Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach", Omega, Int. Journal Mgmt. Science, vol. 25 (6), pp. 619-634, 1997.
    • (1997) Omega, Int. Journal Mgmt. Science , vol.25 , Issue.6 , pp. 619-634
    • Tan, K.C.1    Narasimhan, R.2
  • 19
    • 0030811462 scopus 로고    scopus 로고
    • Developing a simulated annealing algorithm for the cutting stock problem
    • K. K. Lai and J. W. M. Chan, "Developing a simulated annealing algorithm for the cutting stock problem", Comp, and Indust. Engn, vol. 32(1), pp. 115-127, 1997.
    • (1997) Comp, and Indust. Engn , vol.32 , Issue.1 , pp. 115-127
    • Lai, K.K.1    Chan, J.W.M.2
  • 20
    • 84901397345 scopus 로고    scopus 로고
    • A semi-infinite programming model for earliness/tardiness production planning with simulated annealing
    • Y. Li and D. Wang, "A semi-infinite programming model for earliness/tardiness production planning with simulated annealing", Mathematical and Computer Modelling, vol. 37(1-2), pp. 277-280, 1997.
    • (1997) Mathematical and Computer Modelling , vol.37 , Issue.1-2 , pp. 277-280
    • Li, Y.1    Wang, D.2
  • 21
    • 0020534965 scopus 로고
    • Somatic generation of antibody diversity
    • S. Tonegawa, "Somatic generation of antibody diversity", Nature, vol. 302, pp. 575-581, 1983.
    • (1983) Nature , vol.302 , pp. 575-581
    • Tonegawa, S.1
  • 22
    • 0022139003 scopus 로고
    • The molecules of the immune system
    • S. Tonegawa, "The molecules of the immune system", Scientific American, vol. 253(4), pp. 104-113, 1985.
    • (1985) Scientific American , vol.253 , Issue.4 , pp. 104-113
    • Tonegawa, S.1
  • 24
    • 0032320042 scopus 로고    scopus 로고
    • A complete anytime algorithm for number partition ing
    • R Korf, "A complete anytime algorithm for number partition ing", Artificial Intelligence, vol. 106(2), pp. 181-203, 1998.
    • (1998) Artificial Intelligence , vol.106 , Issue.2 , pp. 181-203
    • Korf, R.1


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