메뉴 건너뛰기




Volumn 56, Issue 1, 2009, Pages 186-192

Minimizing the normalized sum of square for workload deviations on m parallel processors

Author keywords

Heuristics; Load balancing; Optimization; Parallel machines scheduling

Indexed keywords

OPTIMIZATION; PERSONNEL; SCHEDULING;

EID: 59049107225     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2008.05.003     Document Type: Article
Times cited : (20)

References (23)
  • 1
    • 33750686925 scopus 로고    scopus 로고
    • Minimizing makespan on identical parallel machines using neural networks
    • Akyol D.E., and Bayhan G.M. Minimizing makespan on identical parallel machines using neural networks. Lecture Notes in Computer Science 4234 (2006) 553-562
    • (2006) Lecture Notes in Computer Science , vol.4234 , pp. 553-562
    • Akyol, D.E.1    Bayhan, G.M.2
  • 3
    • 0016080006 scopus 로고
    • Scheduling independent tasks to reduce mean finishing time
    • Bruno J., Coffman E.G., and Sethi R. Scheduling independent tasks to reduce mean finishing time. Communications of the ACM 17 (1974) 382-387
    • (1974) Communications of the ACM , vol.17 , pp. 382-387
    • Bruno, J.1    Coffman, E.G.2    Sethi, R.3
  • 4
    • 0025474221 scopus 로고
    • A state-of-the-art review of parallel-machine scheduling research
    • Cheng T.C.E., and Sin C.C.S. A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research 47 (1990) 271-292
    • (1990) European Journal of Operational Research , vol.47 , pp. 271-292
    • Cheng, T.C.E.1    Sin, C.C.S.2
  • 10
    • 0014477093 scopus 로고
    • Boundaries on multiprocessing timing anomalies
    • Graham R.L. Boundaries on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics 17 (1969) 416-429
    • (1969) SIAM Journal of Applied Mathematics , vol.17 , pp. 416-429
    • Graham, R.L.1
  • 12
    • 0035241046 scopus 로고    scopus 로고
    • A LISTFIT heuristic for minimizing makespan on identical parallel machines
    • Gupta J.N.D., and Ruiz-Torres A. A LISTFIT heuristic for minimizing makespan on identical parallel machines. Production Planning & Control 12 (2001) 28-36
    • (2001) Production Planning & Control , vol.12 , pp. 28-36
    • Gupta, J.N.D.1    Ruiz-Torres, A.2
  • 13
    • 84989675202 scopus 로고
    • Heuristics for minimizing mean tardiness for m parallel machines
    • Ho J.C., and Chang Y.-L. Heuristics for minimizing mean tardiness for m parallel machines. Naval Research Logistics 38 (1991) 367-381
    • (1991) Naval Research Logistics , vol.38 , pp. 367-381
    • Ho, J.C.1    Chang, Y.-L.2
  • 14
    • 84977404156 scopus 로고
    • Makespan minimization for m parallel processors
    • Ho J.C., and Wong J.S. Makespan minimization for m parallel processors. Naval Research Logistics 42 (1995) 935-948
    • (1995) Naval Research Logistics , vol.42 , pp. 935-948
    • Ho, J.C.1    Wong, J.S.2
  • 16
    • 56549109280 scopus 로고    scopus 로고
    • Koulamas, C., & Kyparsis, G. (2008). A modified LPT algorithm for the two uniform parallel machine makespan minimization problem. European Journal of Operational Research, doi:10.1016/j.ejor.02.008.
    • Koulamas, C., & Kyparsis, G. (2008). A modified LPT algorithm for the two uniform parallel machine makespan minimization problem. European Journal of Operational Research, doi:10.1016/j.ejor.02.008.
  • 18
    • 0023824590 scopus 로고
    • Multiprocessor scheduling: An extension of the multifit algorithm
    • Lee C.Y., and Massey J.D. Multiprocessor scheduling: An extension of the multifit algorithm. Journal of Manufacturing Systems 7 (1988) 25-32
    • (1988) Journal of Manufacturing Systems , vol.7 , pp. 25-32
    • Lee, C.Y.1    Massey, J.D.2
  • 20
    • 41449087604 scopus 로고    scopus 로고
    • Makespan minimization for multiple uniform machines
    • Lin C.-H., and Liao C.-J. Makespan minimization for multiple uniform machines. Computers & Industrial Engineering 54 (2008) 983-992
    • (2008) Computers & Industrial Engineering , vol.54 , pp. 983-992
    • Lin, C.-H.1    Liao, C.-J.2


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