A Multi-Objective Optimization Method for Flexible Job Shop Scheduling Considering Cutting-Tool Degradation with Energy-Saving Measures

نویسندگان

چکیده

Traditional energy-saving optimization of shop scheduling often separates the coupling relationship between a single machine and system, which not only limits potential but also leads to large deviation optimized result actual application. In practice, cutting-tool degradation during operation is inevitable, will lead increase in machining power resulting tool change disrupt rhythm production scheduling. Therefore, make energy consumption calculation more consistent with conditions reduce impact on manufacturing shop, this paper constructs an integrated model including flexible job problem (FJSP), prediction, life prediction strategy. First, exponential function formulated using cutting experiment data under certain express degradation. Utilizing function, reasonable schedule obtained. A hybrid strategy that combines turn-on/off schedules difference simulated while optimizing savings then proposed. Second, multi-objective was established makespan, total load, number times tools are turned on/off changed, workshop fast elitist genetic algorithm (NSGA-II) used solve model. Finally, combined cost evaluation indicator, practical FJSP example presented demonstrate proposed The accuracy than 93%. can further by 4.44% 2.44% basis saving 93.5% non-processing

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Flexible Job Shop Scheduling with Multi Objective Approach

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...

متن کامل

A Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

متن کامل

Multi-Objective Flexible Job Shop Scheduling Optimization Models (II)

For the Multi-Objective Flexible Job Shop Scheduling Problems (MOFJSSP), various optimization models have been designed. In the first part of the research (published in no. 2/2012) we presented the multi-sort production systems, the theoretical aspects of MOFJSSP framework, a specific real JSS process in drugs industry based on over 600 tasks to be optimally scheduled (used as a case study for ...

متن کامل

Multi-Objective Flexible Job Shop Scheduling Optimization Models (I)

In manufacturing area, the most difficult problems related to the time-efficiency frequently occur if the jobs to be scheduled are heterogeneous, if there are alternative routes on the machines for the jobs and multiple objectives are imposed. This framework, named Multi-Objective Flexible Job Shop Scheduling Problems (MOFJSSP), has been formalized, modeled and studied in the last decades from ...

متن کامل

A Hybrid Multi Objective Algorithm for Flexible Job Shop Scheduling

Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, it quit difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. The combining of several optimization criteria induces additional complexity and new problems. In this paper, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11020324