Abstract
Nowadays, manufacturing enterprises, as larger energy consumers, face the severe environmental challenge and the mission of reducing energy consumption. Therefore, how to reduce energy consumption becomes a burning issue for manufacturing. Production scheduling provides a feasible scheme for energy saving on the system level. However, the existing researches of energy-saving scheduling rarely focus on the permutation flow line scheduling problem. This article proposes an energy-saving method for permutation flow line scheduling problem. First, a mathematical model for the permutation flow line scheduling problem is developed based on the principle of multiple energy source system of the computer numerical control machine tool. The optimization objective of this model is to simultaneously minimize the total flowtime and the fixed energy consumption. Since permutation flow line scheduling problem is a well-known NP-hard problem, the non-dominated sorting genetic algorithm II is adopted to solve the multi-objective permutation flow line scheduling problem. Finally, the effectiveness of this method is verified by numerical illustration. The computation results show that a significant trade-off between total flowtime and fixed energy consumption for the permutation flow line scheduling problem, and there would be potential for saving energy consumption by using the proposed method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.