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

  • 학술저널

Jafar Bagherinejad(Alzahra University) Farideh Zare(Alzahra University)

DOI : 10.7232/iems.2019.18.3.340

표지

북마크 0

리뷰 0

이용수 1

피인용수 0

초록

In this study we present a bi-objective model for multi-mode resource constrained scheduling problem in order to minimize Net present value of costs and the makespan simultaneously. In this case, the time limit of availability of renewable resource is considered besides the common constraints of these kinds of problems of the relevant literature. Some of these resources are usable only in a predetermined time interval. These resources have certain availability time and due date, they are not available before the availability time and have penalty costs after due date. Also, the payments are based on progress payment. The main goal is scheduling and determining the method of each activity in order to optimize the objective functions, including net present value and makespan. The proposed model has been solved by NSGAII and NRGA algorithms. Finally, to compare the performances of these algorithms, sample problems of project scheduling problem library are used. The obtained results indicate the better performance of NSGAII.

목차

ABSTRACT
1. INTRODUCTION
2. LITERATURE REVIEW
3. PROBLEM DESCRIPTION
4. MODEL STATEMENT
5. NON-DOMINATED SORTING GENETIC ALGORITHM (NSAGII)
6. NON-DOMINATED ROULETTE GENETIC ALGORITHM
7. ANALYSIS RESULTS
8. Conclusion
REFERENCES

참고문헌(0)

리뷰(0)

도움이 되었어요.0

도움이 안되었어요.0

첫 리뷰를 남겨주세요.
Insert title here