شما هنوز به سایت وارد نشده اید.
یکشنبه 04 آذر 1403
ورود به سایت
آمار سایت
بازدید امروز: 19,774
بازدید دیروز: 26,897
بازدید کل: 157,700,674
کاربران عضو: 1
کاربران مهمان: 78
کاربران حاضر: 79
A hybrid local search algorithm for scheduling real-world job shops with batch-wise pending due dates
Abstract:

This paper aims at solving a real-world job shop scheduling problem with two characteristics, i.e., the existence of pending due dates and job batches. Due date quotation is an important decision process for contemporary companies that adopt the MTO (make to order) strategy. Although the assignment of due dates is usually performed separately with production scheduling, there exist strong interactions between the two tasks. Therefore, we integrate these two decisions into one optimization model. Meanwhile, each order placed by the customer defines a batch of jobs, for which the same due date should be set. Thus, the completion times of these jobs should be close to one another in order to reduce waiting time and cost. For this purpose, we propose a dispatching rule to synchronize their manufacturing progresses. A two-stage local search algorithm based on the PMBGA (probabilistic model-building genetic algorithm) and parameter perturbation is proposed to solve the integrated scheduling problem and its superiority is revealed by the applications to a real-world mechanical factory

Keywords: Due dateassignment Real-world jobshopscheduling Probabilistic model-buildinggenetic algorithm Local search Weighted tardiness
Author(s): .
Source: Engineering Applications of Artificial Intelligence 25 (2012) 209–221
Subject: تولید
Category: مقاله مجله
Release Date: 2012
No of Pages: 13
Price(Tomans): 0
بر اساس شرایط و ضوابط ارسال مقاله در سایت مدیر، این مطلب توسط یکی از نویسندگان ارسال گردیده است. در صورت مشاهده هرگونه تخلف، با تکمیل فرم گزارش تخلف حقوق مؤلفین مراتب را جهت پیگیری اطلاع دهید.