An Efficient Bi-Objective Genetic Algorithm for the Single Batch- Processing Machine Scheduling Problem with Sequence-DependentFamily Setup Time and Non-Identical Job Sizes
سال انتشار: 1397
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 527
فایل این مقاله در 14 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
این مقاله در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-11-2_007
تاریخ نمایه سازی: 22 آبان 1397
چکیده مقاله:
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families, and sequence-dependent family setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for this problem; then, it is solved by constraint method. Since this problem is NP-hard, a bi-objective genetic algorithm (BOGA) is offered for real-sized problems. The efficiency of the proposed BOGA is evaluated to be compared with many test problems by -constraint method based on performance measures. The results show that the proposed BOGA is found to be more efficient and faster than the -constraint method in generating Pareto fronts in most cases.
کلیدواژه ها:
نویسندگان
Javad Rezaeian
Department of Industrial Engineering, Mazandaran University of Science and Technology
Yaser Zarook
Department of Industrial Engineering, Mazandaran University of Science and Technology