کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
413639 680647 2013 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm
چکیده انگلیسی


• We model an energy-efficient scheduling with makespan and energy consumption.
• We give an improved genetic-simulated annealing algorithm to get Pareto solutions.
• The relationship between makespan and energy consumption is identified conflict.
• We examine an energy saving decision for multi-machines in a feasible scheduling.

The traditional production scheduling problem considers performance indicators such as processing time, cost, and quality as optimization objectives in manufacturing systems; however, it does not take energy consumption or environmental impacts completely into account. Therefore, this paper proposes an energy-efficient model for flexible flow shop scheduling (FFS). First, a mathematical model for a FFS problem, which is based on an energy-efficient mechanism, is described to solve multi-objective optimization. Since FFS is well known as a NP-hard problem, an improved, genetic-simulated annealing algorithm is adopted to make a significant trade-off between the makespan and the total energy consumption to implement a feasible scheduling. Finally, a case study of a production scheduling problem for a metalworking workshop in a plant is simulated. The experimental results show that the relationship between the makespan and the energy consumption may be apparently conflicting. In addition, an energy-saving decision is performed in a feasible scheduling. Using the decision method, there could be significant potential for minimizing energy consumption.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Robotics and Computer-Integrated Manufacturing - Volume 29, Issue 5, October 2013, Pages 418–429
نویسندگان
, , , , ,