Optimizing and Solving Project Scheduling Problem for Flexible Networks with Multiple Routes in Production Environments

In production environments, multi-route Resource-Constrained Project Scheduling Problem (RCPSP) is more complex and consists of two types of flexible and fixed parts. The flexible parts comprise the semi-finished products and each part has multiple routes denoted independently with activities and predictive relationships. This research develops a new Mixed‐Integer Nonlinear Programming (MINLP) model to minimize the makespan. The proposed mathematical model identifies the optimal routes and, consequently, determines the optimal project network. Also, it allocates renewable resources to each production activity. Production sequencing of activities is optimized by the proposed model. A new hybrid approach by regarding GA and PSO in a binary solving space is introduced to handle two main sub-problems of RCPSP-MR in production environments, namely route selection and production scheduling. To evaluate the presented optimization model and algorithm, 60 test problems in various sizes are reported in detail.

Article Type:
Research/Original Article
Journal of Quality Engineering and Production Optimization, Volume:3 Issue:3, 2019
175 - 196
روش‌های دسترسی به متن این مطلب
اشتراک شخصی
در سایت عضو شوید و هزینه اشتراک یک‌ساله سایت به مبلغ 300,000ريال را پرداخت کنید. همزمان با برقراری دوره اشتراک بسته دانلود 100 مطلب نیز برای شما فعال خواهد شد!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی همه کاربران به متن مطالب خریداری نمایند!