Although many papers deal with the permutation flowshop scheduling problem with or without setups, according to our knowledge, little has been published tackling multi-objective optimization in presence of sequence dependent setup times. Hence, in this work we cope with this problem considering two pairs of well known independent objectives, the Cmax−TWT (Makespan-Total Weighted Tardiness ) and...

ادغام داده‌ها بین حسگرهای مختلف می‌تواند موجب استخراج اطلاعات با دقت و کیفیت بالاتر گردد بهبود تشخیص تهدیدهای هسته‌ای را به همراه داشته باشد. در این تحقیق، ردیابی چشمه متحرک استفاده از تلفیق داده­های سیستم آشکارساز پرتوی دوربین نظارتی مورد مطالعه قرار گرفت است. بدین منظور الگوریتمی جهت ایجاد همبستگی تصاویر دریافتی توسط شمارش طراحی شده است تا مسیر حرکت جسمی که بیش­ترین ثبت آشکارسازی دارد عنوان ا...

Scheduling in a permutation flowshop refers to processing of jobs set available machines the same order. Among several possible performance characteristics flowshop, makespan remains one highest preferred metrics by researchers past six decades. The constructive heuristic proposed Nawaz-Enscore-Ham (NEH) is best for minimization. essentially depends on initial ordering according particular prio...

Abstract The distributed manufacturing has become a prevail production mode under the economic globalization. In this article, memetic discrete differential evolution (MDDE) algorithm is proposed to address permutation flow shop scheduling problem (DPFSP) with minimization of makespan. An enhanced NEH (Nawaz–Enscore–Ham) method presented produce potential candidate solutions and Taillard’s acce...

The blocking flow-shop scheduling problem, which is an NP-hard has wide applications in industry. Many studies have focused primarily on single-objective optimization, such as minimizing the makespan or total flow time, insufficient for practical problems. In this study, a problem with bicriteria of and machine utilization considered. A simple constructive heuristic, NEHCG, proposed by developi...