본문 바로가기
[학술저널]

  • 학술저널

Hafed M. Motair(Ministry of Education)

DOI : 10.7232/iems.2020.19.4.803

표지

북마크 0

리뷰 0

이용수 1

피인용수 0

초록

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 (ΣjCj ) (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

참고문헌(0)

리뷰(0)

도움이 되었어요.0

도움이 안되었어요.0

첫 리뷰를 남겨주세요.
DBpia에서 서비스 중인 논문에 한하여 피인용 수가 반영됩니다.
인용된 논문이 DBpia에서 서비스 중이라면, 아래 [참고문헌 신청]을 통해서 등록해보세요.
Insert title here