Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times

Abstract

This paper presents a novel method on the optimization of bi-objective Flexible Job-shop Scheduling Problem (FJSP) under stochastic processing times. The robust counterpart model and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are used to solve the bi-objective FJSP with consideration of the completion time and the total energy consumption under stochastic processing times. The case study on GM Corporation verifies that the NSGA-II used in this paper is effective and has advantages to solve the proposed model comparing with HPSO and PSO+SA. The idea and method of the paper can be generalized widely in the manufacturing industry, because it can reduce the energy consumption of the energy-intensive manufacturing enterprise with less investment when the new approach is applied in existing systems.

A New Energy-Aware Flexible Job Shop Scheduling Method Using Modified Biogeography-Based Optimization

“…Liu and Tiwari [21] developed an optimization approach based on NSGA-II to make the scheduling plans for a carbon fiber reinforced polymer recycling workshop, considering both makespan and energy reduction under the circumstance of flexible job shop. Yang et al [22] used NSGA-II for solving FJSSP considering makespan and total energy consumption under stochastic processing times. Lei et al [23] proposed a shuffled frog-leaping algorithm to investigate FJSSP with the objective of minimizing workload balance and total energy consumption.…”

Game theory based real-time multi-objective flexible job shop scheduling considering environmental impact

“…In the traditional MO-FJSS problem, the multi-objective optimisation approaches mainly include the Pareto optimisation, the non-dominant approach, and the weighted approach. Among them, Pareto optimisation and non-dominant approach present a set of solutions for the decision makers to choose from (Lei, 2008;Kachitvichyanukul and Sitthitham, 2011;Li et al, 2012;Liu et al, 2014a;Wang et al, 2016). However, it is economically infeasible to let decision makers choose from a large group of alternative solutions at each decision point.…”

Parallel Counting Sort: A Modified of Counting Sort Algorithm

“…Although sorting usually being used in computer engineer, but sorting used in another field of study too. For example, sorting can be implemented in education [1] [2], in biology [3], or even in economy [4][5] field of study. In computer engineering itself, sorting process can be used in many ways, such as network engineering [6] [7], big data process [8] [9], or in database process [10].…”