연구동향 분석

A Branch-and-Bound Algorithm to Minimize the Makespan in a Fire Scheduling Problem

차영호(Young Ho Cha) 방준영(June Young Bang) 2015년

논문상세정보
인용/피인용
' A Branch-and-Bound Algorithm to Minimize the Makespan in a Fire Scheduling Problem' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • 산업경제 일반
  • branch and bound
  • firescheduling
  • military
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
1,154 0

0.0%

' A Branch-and-Bound Algorithm to Minimize the Makespan in a Fire Scheduling Problem' 의 참고문헌

  • 포병부대 사격순서결정을 위한 분지한계 알고리즘 연구
    윤상흠 산업경영시스템학회지 33 (3) : 154 ~ 161 [2010]
  • 분산분석을 활용한 K11 복합형소총 사격통제장치 균열발생 원인 연구
    신상식 품질경영학회지 43 (3) : 289 ~ 298 [2015]
  • 다구찌 손실함수 개념을 응용한 국방품질스코어 적용 가능성에 대한 연구 : 군수품 사례 위주
    안남수 품질경영학회지 41 (3) : 443 ~ 456 [2013]
  • 국방 품질보증 활동 강화를 위한 샘플링 방법 개선: 전투물자 및 탄약 분야 사례 위주
    안남수 품질경영학회지 40 (3) : 245 ~ 258 [2012]
  • 공유표적을 포함한 사격순서 결정에 관한 연구
    김태헌 한국경영과학회지 28 (3) : 123 ~ 134 [2003]
  • The heuristic algorithm for the fire target allocation and sequencing problem
    Kim, D.-H. Proceedings of the 2008 spring KIIE conference [2008]
  • The complexity of scheduling independent two-processor tasks on dedicated processors
    Kubale, M. Information Processing Letters 24 : 141 ~ 147 [1987]
  • Targeting and scheduling problem for field artillery
    Kwon, O. -J. Computers and Industrial Engineering 33 : 693 ~ 696 [1997]
  • Scheduling multiprocessor tasks-An overview
    Drozdowski, M. European Journal of Operational Research 94 : 215 ~ 230 [1996]
  • Scheduling multiprocessor tasks on three dedicated processors
    Blazewicz, J. Information Processing Letters 41 : 275 ~ 280 [1992]
  • Scheduling independent multiprocessor tasks
    Amoura, A. K. Algorithmica 32 : 247 ~ 261 [2002]
  • Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
    Brucker, P. European Journal of Operational Research 90 : 214 ~ 216 [1996]
  • Nonpreemptive scheduling of independent tasks with prespecified processor allocations
    Bianco, L. Naval Research Logistics 41 : 959 ~ 971 [1994]
  • General multiprocessor tasks scheduling
    Chen, J. Naval Research Logistics 46 : 57 ~ 74 [1999]
  • General multiprocessor task scheduling : approximate solutions in linear time
    Jansen, K. SIAM Journal on Computing 35 : 519 ~ 530 [2005]
  • Fire scheduling for planned artillery attack operations under time-dependent destruction probabilities
    Cha, Y.-H. Omega 38 (5) : 383 ~ 392 [2010]
  • Efficiency and effectiveness of normal schedules on three dedicated processors
    Dell’Olmo, P. Discrete Mathematics 164 : 67 ~ 79 [1997]
  • Current trends in deterministic scheduling
    Lee, C. -Y. Annals of Operations Research 70 : 1 ~ 41 [1997]
  • Computers and intractability : a guide to the theory of NP-completeness
    Garey, M.R. Freeman [1979]
  • Complexity of scheduling multiprocessor tasks with prespecified processor allocations
    Hoogeveen, J. A. Discrete Applied Mathematics 55 : 259 ~ 272 [1994]
  • Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
    Kramer, A. OR Spektrum 19 : 219 ~ 227 [1997]
  • Approximation algorithms for scheduling
    Hall, L.A. PWS Publishing Company : 1 ~ 45 [1997]
  • A simple linear time approximation algorithm for multi-processor job scheduling on four processors
    Huang, J. Journal of Combinatorial Optimization 13 : 33 ~ 45 [2007]
  • A polynomial time approximation scheme for general multiprocessor job scheduling
    Chen, J. SIAM Journal on Computing 31 : 1 ~ 17 [2001]
  • A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
    Nawaz, M. Omega 11 (1) : 91 ~ 95 [1983]
  • A branch and bound algorithm for the continuous-process job-shop scheduling problems
    Bozoki, G. AIIE Transactions 2 : 246 ~ 252 [1970]