مشخصات مقاله | |
ترجمه عنوان مقاله | یک مدل بهینهسازی قابل تنظیم نیرومند برای مساله زمانبندی پروژه با محدودیت منابع با طول مدت نامشخص فعالیت |
عنوان انگلیسی مقاله | An adjustable robust optimization model for the resource-constrained project scheduling problem with uncertain activity durations |
انتشار | مقاله سال 2017 |
تعداد صفحات مقاله انگلیسی | 48 صفحه |
هزینه | دانلود مقاله انگلیسی رایگان میباشد. |
پایگاه داده | نشریه الزویر |
نوع نگارش مقاله |
مقاله پژوهشی (Research article) |
مقاله بیس | این مقاله بیس میباشد |
نمایه (index) | scopus – master journals – JCR |
نوع مقاله | ISI |
فرمت مقاله انگلیسی | |
ایمپکت فاکتور(IF) |
4.973 در سال 2017 |
شاخص H_index | 108 در سال 2019 |
شاخص SJR | 3.521 در سال 2017 |
شناسه ISSN | 0305-0483 |
شاخص Quartile (چارک) | Q1 در سال 2017 |
رشته های مرتبط | مدیریت – مهندسی صنایع |
گرایش های مرتبط | مدیریت پروژه – برنامه ریزی و تحلیل سیستم ها |
نوع ارائه مقاله |
ژورنال |
مجله / کنفرانس | Omega |
دانشگاه | Department of Mechanical, Energy and Management Engineering, University of Calabria, 87036 Rende, Italy |
کلمات کلیدی | زمانبندی پروژه، محدودیتهای منبع، بهینهسازی نیرومند، تجزیهی بندرز . |
کلمات کلیدی انگلیسی | Project scheduling, Resource constraints, Robust optimization, Benders decomposition |
شناسه دیجیتال – doi |
https://doi.org/10.1016/j.omega.2016.09.009 |
کد محصول | E11812 |
وضعیت ترجمه مقاله | ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید. |
دانلود رایگان مقاله | دانلود رایگان مقاله انگلیسی |
سفارش ترجمه این مقاله | سفارش ترجمه این مقاله |
فهرست مطالب مقاله: |
Outline Abstract Keywords 1. Introduction 2. Related literature 3. Problem definition 4. Exact solution approach 5. The cardinality constrained uncertainty set 6. Computational experiments 7. Conclusions Appendix A. Numerical results Appendix B. Formal proofs Appendix C. Pseudo-code of dynamic programming (51) References |
بخشی از متن مقاله: |
Abstract This paper addresses the resource-constrained project scheduling problem with uncertain activity durations. An adaptive robust optimization model is proposed to derive the resource allocation decisions that minimize the worst-case makespan, under general polyhedral uncertainty sets. The properties of the model are analyzed, assuming that the activity durations are subject to interval uncertainty where the level of robustness is controlled by a protection factor related to the risk aversion of the decision maker. A general decomposition approach is proposed to solve the robust counterpart of the resource-constrained project scheduling problem, further tailored to address the uncertainty set with the protection factor. An extensive computational study is presented on benchmark instances adapted from the PSPLIB. Introduction The resource-constrained project scheduling problem (RCPSP) consists in sequencing and scheduling project activities usually related by precedence and resource constraints involving renewable scarce resources. As comprehensively investigated in the literature, the RCPSP is an outstanding and challenging problem both in practice, since it arises in many important application fields (construction industry [20, 40], rolling ingots production [55, 57], to mention a few), and in theory. The majority of the scientific contributions considers the model parameters deterministic ([41]). However, in the last years a frank acknowledgment of the uncertainties characterizing the project environment and a growing attention on the project execution, have highlighted the need of incorporating the uncertainty in problem parameters as an inevitable feature of the decision-making process [2, 52]. In fact, due to employees’ absenteeism, delays in materials supply, bad weather conditions and many other uncontrollable factors, some project activities may last longer than expected, threatening the operational viability of the planned schedule. |