지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2015.1
- 수록면
- 132 - 141 (10page)
이용수
초록· 키워드
오류제보하기
We focus on the fire scheduling problem (FSP), the problem of determining the sequence of targets to be fired at, for the objective of minimizing makespan to achieve tactical goals. In this paper, we assume that there are m available weapons to fire at n targets (> m) and the weapons are already allocated to targets. One weapon or multiple weapons can fire at one target and these fire operations should start simultaneously while the finish time of them may be different. We develop several dominance properties and a lower bound for the problem, and suggest a branch and bound algorithm implementing them. Also, In addition, heuristic algorithms that can be used for obtaining an initial upper bound in the B&B algorithm and for obtaining good solutions in a short time were developed. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithm solves problems of a medium size in a reasonable amount of computation time. The proposed lower bound, the dominance properties, and the heuristics for upper bound are tested in B&B respectively, and the result showed that lower bound is effective to fathoming nodes and the dominance properties and heuristics also worked well. Also, it is showed that the CPU time required by this algorithm increases rapidly as the problem size increases. Therefore, the suggested B&B algorithm would be limited to solve large size problems. However, the employed heuristic algorithms can be effectively used in the B&B algorithm and can give good solutions for large problems within a few seconds.
목차
등록된 정보가 없습니다.
참고문헌 (26)
참고문헌 신청
Amoura, A. K. / 2002 / Scheduling independent multiprocessor tasks / Algorithmica 32 : 247 ~ 261
Bianco, L. / 1994 / Nonpreemptive scheduling of independent tasks with prespecified processor allocations / Naval Research Logistics 41 : 959 ~ 971
Blazewicz, J. / 1992 / Scheduling multiprocessor tasks on three dedicated processors / Information Processing Letters 41 : 275 ~ 280
Bozoki, G. / 1970 / A branch and bound algorithm for the continuous-process job-shop scheduling problems / AIIE Transactions 2 : 246 ~ 252
Brucker, P. / 1996 / Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems / European Journal of Operational Research 90 : 214 ~ 216
Bianco, L. / 1994 / Nonpreemptive scheduling of independent tasks with prespecified processor allocations / Naval Research Logistics 41 : 959 ~ 971
Blazewicz, J. / 1992 / Scheduling multiprocessor tasks on three dedicated processors / Information Processing Letters 41 : 275 ~ 280
Bozoki, G. / 1970 / A branch and bound algorithm for the continuous-process job-shop scheduling problems / AIIE Transactions 2 : 246 ~ 252
Brucker, P. / 1996 / Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems / European Journal of Operational Research 90 : 214 ~ 216
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
단일 호이스트 생산시스템에서 다양한 주문을 처리하기 위한 분지한계 기반의 휴리스틱 일정계획
대한산업공학회지
2016 .06
-
표적 할당 및 사격순서결정문제를 위한 최적해 알고리즘 연구
산업경영시스템학회지
2019 .01
-
A Fire Sequencing Problem to Minimize the Total Weighted Firing Completion Time of the Artillery Weapons
Industrial Engineering & Management Systems
2018 .06
-
Two-Agent Single-Machine Scheduling with Linear Job-Dependent Position-Based Learning Effects
산업경영시스템학회지
2015 .01
-
A Branch-and-Bound for Production-and-Delivery Scheduling with Dynamic Delivery Cost Allowed
Industrial Engineering & Management Systems
2018 .06
-
A Multi-Objective Evolutionary Algorithm for Scheduling Flexible Manufacturing Systems
Industrial Engineering & Management Systems
2017 .06
-
Differential Evolution Algorithms Solving a Multi-Objective, Source and Stage Location-Allocation Problem
Industrial Engineering & Management Systems
2015 .03
-
Survival Probability Map Based Path Planning of Mobile Robots
제어로봇시스템학회 국제학술대회 논문집
2015 .10
-
Research of Graph-analytical Methods for a Vehicle Motion Planning
제어로봇시스템학회 국제학술대회 논문집
2015 .10
-
개척자 기반 새로운 최적화 알고리즘: POA (Pioneer-inspired Optimization Algorithm)
한국지능시스템학회 논문지
2021 .12
-
A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem
Industrial Engineering & Management Systems
2016 .09
-
A Novel Approach for Task Scheduling in Parallel Computing using Priority Attributes
SmartCR
2015 .08
-
An Optimal Algorithm for the Reliability Optimization Problem of a Series System with Selectable Alternatives
Industrial Engineering & Management Systems
2021 .03
-
유전 알고리즘을 이용한 두 단계 이종병렬기계 시스템의 일정계획
대한산업공학회지
2021 .02
-
Arbitrary Processor Network Scheduling Algorithms in Parallel Computing
SmartCR
2015 .06
-
A New Hybrid Algorithm for the Resource Constraint Project Scheduling Problem
Industrial Engineering & Management Systems
2022 .09
-
작업자 1명이 셋업을 수행하는 이종병렬기계에서 조기 및 지연 완료를 최소화하는 생산일정계획
한국경영공학회지
2022 .12
-
유전알고리즘을 활용한 중첩 대기시간 제약 플로우샵 스케줄링
대한산업공학회지
2021 .02
-
A new transmission rate upper bound of HK scheme for Interference system with M-QAM
JOURNAL OF PLATFORM TECHNOLOGY
2015 .12
-
Production Planning Method Using the Push-back Heuristic Algorithm: Implementation in a Micro Filter Manufacturer in South Korea
Industrial Engineering & Management Systems
2015 .12
이 논문의 저자 정보
최근 본 자료
댓글(0)
0