Skip to content
naulon
Not checkedNot checked for notices yet.

A Benefit Conflict Resolution Approach for Production Planning Energy Optimization of Group Manufacturing

Zhengchao Liu, Shunsheng Guo, Lei Wang and 2 more

IEEE Access · 2019

doi:10.1109/access.2019.2908934 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

With the aggravation of global environmental problems, energy saving, and emission reduction are urgent for the manufacturing industry. However, due to the difficulty in coordinating the manufacturing behaviors and profit targets of different subsidiaries, the large complex product manufacturing group is difficult to transform from traditional profit-oriented to green-oriented. To this end, this paper proposes two production planning optimization strategies for the manufacturing group. One is the profit-optimized strategy that optimizes the cost and makespan of the group manufacturing process. The other is the energy-optimized strategy that adds the energy consumption objective to the group's original objectives. Meanwhile, the potential benefit conflict of different strategies is considered in this paper. The non-cooperative game is introduced to analyze the benefit allocation under the two strategies and formulate a reward mechanism to encourage the subsidiaries to participate in the energy-optimized strategy. Then, a novel hybrid MONSGA-II&MSNE approach is presented to address the integrated problem. To effectively optimize the two strategies, the MONSGA-II is improved by the multi-oriented optimization heuristic strategy in two aspects: 1) enhancing the local search ability of NSGA-II and 2) solving the matching conflict problem in the crossover operation. The mixed strategy Nash equilibrium (MSNE) is applied to calculate the cost-optimal reward mechanism under different game combinations. Finally, the performance of the proposed approach is demonstrated in the case study.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.