Constrained Supply Chain Scheduling Model Using Sequential Quadratic Programming Algorithm

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

Challenges such as advances in technology, demands of the global market, and limited warehouse spaces resort manufacturing industries to subcontracting. Subcontracting has been a considerable alternative in the manufacturing industries and is utilized as a strategic tool to diminish operation costs primarily to address the problem of scarcity when the firm faces a large demand on the commodity it supplies. The present study employed a mathematical model among firms engaging in subcontracting in search of an optimal schedule in the manufacture of the product and distribution of production time involved with an objective of obtaining a maximum profit. The constraints in the mathematical formulation included the total demand, processing capacity, available supply, processing rate, and time. The plausibility and the possible utility of the mathematical model has been explored employing sequential quadratic programming algorithm in the search of the optimal solutions.

Language:
English
Published:
Journal of Sciences, Islamic Republic of Iran, Volume:31 Issue: 4, Autumn 2020
Pages:
349 to 356
magiran.com/p2205668  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!