Minimizing Makespan in Job Shop Scheduling Problem with Parallel Machines
In this paper the problem of job shop scheduling with parallel machines in each stages is discussed. The objective is to minimize the maximum completion time (makespan).�This problem is a combination of two classic problems of job shop and parallel machines which in this case parallel machines has been used as kind of flexibility in the job shop problem. The review of literature has shown that this problem has not been discussed yet. After presenting the mathematical mode, heuristic algorithms are used for solving this NP-hard problem. Regarding this, five algorithms are presented and a lower bound is developed. Finally all these algorithms have been analyzed. According to results the proposed algorithm of H2 works better than the others when there are few jobs. As the number of jobs increases H1 is more efficient than H2 asymptotically. Also the efficiency of H3 algorithm is the worst among the rest.
International Journal of Industrial Engineering & Production Management, Volume:20 Issue: 2, 2009
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 990,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

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