지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 대한산업공학회 Industrial Engineering & Management Systems Industrial Engineering & Management Systems Vol.19 No.4
- 발행연도
- 2020.12
- 수록면
- 803 - 811 (9page)
- DOI
- 10.7232/iems.2020.19.4.803
이용수
초록· 키워드
오류제보하기
This paper present an insertion procedure (IP) which can be used to improve the performance of the multiobjective scheduling problems (MOSPs) algorithms. The proposed procedure use the variable neighborhood search (VNS) combined with insertion method which can be adapted with any MOSP whether it is heuristic or metaheuristic. The aim is to solve 2- machine permutation flowshop scheduling problem (PFSP) and minimize the two objective functions simultaneously: Maximum completion time (makespan) and total completion times (Σ<SUB>j</SUB>C<SUB>j</SUB> ) (TCT) in order to find the efficient (non dominated) solutions. The proposed IP combined with two algorithms in the literature, the non dominated sorting genetic algorithm (NSGA-2) and the multi-objective partial enumeration algorithm (MOPE), the objective is to explore more non dominating solution by the use of insertion concept of jobs through all possible positions of considered sequence. To evaluate the algorithms, large set of test instances involving up to 80 jobs were used for our investigation. The results show the efficiency of the proposed IP to improve the performance of considered MOSPs algorithms.
목차
ABSTRACT
1. INTRODUCTION
2. LIERATURE REVIEW
3. PROBLEM CONSTRAINS AND FORMULATION
4. PROPOSED ALGORITHMS
5. PROPOSED IP
6. PROPOSED ALGORITHMS
7. PERFORMANCE OF THE PROPOSED ALGORITHMS
8. CONCOLUSIONS AND FUTURE WORK
REFERENCES
참고문헌 (30)
참고문헌 신청
Aldowaisan, T. / 2004 / New heuristics for m-machine no-wait flowshop to minimize total completion time / Omega 32(5):345~352
Arroyo, J. E. C. / 2004 / A partial enumeration heuristic for multi-objective flowshop scheduling problems / Journal of the Operational Research Society 55(9):1000~1007
Arroyo, J. E. C. / 2011 / Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows / Electronic Notes in Theoretical Computer Science 281:5~19
de Siqueira, E. C. / 2020 / An MO-GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem / International Transactions in Operational Research 27(1):614~650
Deb, K. / 2013 / An evolutionary manyobjective optimization algorithm using referencepoint-based nondominated sorting approach, part I : solving problems with box constraints / IEEE Transactions on Evolutionary Computation 18(4):577~601
Arroyo, J. E. C. / 2004 / A partial enumeration heuristic for multi-objective flowshop scheduling problems / Journal of the Operational Research Society 55(9):1000~1007
Arroyo, J. E. C. / 2011 / Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows / Electronic Notes in Theoretical Computer Science 281:5~19
de Siqueira, E. C. / 2020 / An MO-GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem / International Transactions in Operational Research 27(1):614~650
Deb, K. / 2013 / An evolutionary manyobjective optimization algorithm using referencepoint-based nondominated sorting approach, part I : solving problems with box constraints / IEEE Transactions on Evolutionary Computation 18(4):577~601
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Survival Probability Map Based Path Planning of Mobile Robots
제어로봇시스템학회 국제학술대회 논문집
2015 .10
-
Research of Graph-analytical Methods for a Vehicle Motion Planning
제어로봇시스템학회 국제학술대회 논문집
2015 .10
-
A genetic algorithm for scheduling problem in cell culturing
대한산업공학회 춘계공동학술대회 논문집
2023 .05
-
A Multi-Objective Evolutionary Algorithm for Scheduling Flexible Manufacturing Systems
Industrial Engineering & Management Systems
2017 .06
-
Improved Expectation-maximization Algorithm using Genetic Algorithm for Big Data
한국지능시스템학회 학술발표 논문집
2016 .04
-
A New Hybrid Algorithm for the Resource Constraint Project Scheduling Problem
Industrial Engineering & Management Systems
2022 .09
-
A genetic Algorithm for scheduling problem in cell culturing with multi-type chambers
대한산업공학회 추계학술대회 논문집
2023 .11
-
유전 알고리즘의 연산처리를 통한 개선된 경로 탐색 기법
전기학회논문지 P
2015 .12
-
효율적인 유전 알고리즘을 활용한 요격미사일 할당 및 교전 일정계획의 최적화
산업경영시스템학회지
2016 .01
-
유전알고리즘을 활용한 중첩 대기시간 제약 플로우샵 스케줄링
대한산업공학회지
2021 .02
-
A Novel Approach for Task Scheduling in Parallel Computing using Priority Attributes
SmartCR
2015 .08
-
Scheduling for a Container Supply Chain to Minimize Costs Using the Meta-Innovation Approach
Industrial Engineering & Management Systems
2021 .12
-
다중 로봇의 스케줄링을 위한 유전 알고리즘의 목적함수
제어로봇시스템학회 국내학술대회 논문집
2024 .07
-
Scheduling for a Container Supply Chain to Minimize Costs Using the Meta-Innovation Approach
Industrial Engineering & Management Systems
2022 .06
-
Application of Forest Optimization Algorithm for the Resource Constraint Project Scheduling
Industrial Engineering & Management Systems
2022 .06
-
새로운 규칙유도 알고리즘과 앙상블 기법의 하이브리드 알고리즘
대한산업공학회 추계학술대회 논문집
2020 .11
-
제조와 배치배송이 결합된 일정계획을 위한 VNS 알고리즘의 탐색효율에 관한 연구
한국 SCM 학회지
2019 .10
-
Comparison of Genetic Algorithm and Pattern Search Algorithm for Optimization-Based Hand Posture Prediction
대한인간공학회 학술대회논문집
2017 .11
-
New circle clustering algorithm for vehicle routing problem
한국 SCM 학회지
2015 .05
-
An Efficient Modified Immigrant Population Search Algorithm for Optimization over Unconstrained Spaces
Industrial Engineering & Management Systems
2019 .03
이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0