scholarly journals An Enhanced MOPSO Algorithm for Energy-Efficient Single-Machine Production Scheduling

2019 ◽  
Vol 11 (19) ◽  
pp. 5381 ◽  
Author(s):  
Yueyue Liu ◽  
Xiaoya Liao ◽  
Rui Zhang
Keyword(s):  
Energy Consumption ◽  
Local Search ◽  
Single Machine ◽  
Optimization Algorithm ◽  
Production Scheduling ◽  
Manufacturing Systems ◽  
Manufacturing Industry ◽  
Scheduling Problem ◽  
Nsga Ii ◽  
Multi Objective

In recent years, the concerns on energy efficiency in manufacturing systems have been growing rapidly due to the pursuit of sustainable development. Production scheduling plays a vital role in saving energy and promoting profitability for the manufacturing industry. In this paper, we are concerned with a just-in-time (JIT) single machine scheduling problem which considers the deterioration effect and the energy consumption of job processing operations. The aim is to determine an optimal sequence for processing jobs under the objective of minimizing the total earliness/tardiness cost and the total energy consumption. Since the problem is NP -hard, an improved multi-objective particle swarm optimization algorithm enhanced by a local search strategy (MOPSO-LS) is proposed. We draw on the idea of k-opt neighborhoods and modify the neighborhood operations adaptively for the production scheduling problem. We consider two types of k-opt operations and implement the one without overlap in our local search. Three different values of k have been tested. We compare the performance of MOPSO-LS and MOPSO (excluding the local search function completely). Besides, we also compare MOPSO-LS with the well-known multi-objective optimization algorithm NSGA-II. The experimental results have verified the effectiveness of the proposed algorithm. The work of this paper will shed some light on the fast-growing research related to sustainable production scheduling.

scholarly journals Solving Just-in-Time Single Machine Scheduling with Variable Discrete Speed Machine using Hybrid NSGA-II

2021 ◽  
Vol 22 (2) ◽  
pp. 211-223
Author(s):  
Bobby Kurniawan ◽  
Ade Irman ◽  
Evi Febianti ◽  
K Kulsum ◽  
Lely Herlina ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Local Search ◽  
Single Machine ◽  
Energy Demand ◽  
Production Efficiency ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Just In Time ◽  
Scheduling Problem ◽  
Nsga Ii

Due to industrialization and population growth, increasing energy demand can lead to energy scarcity because non-renewable resources are primarily used as energy sources. In addition, carbon dioxide gas, the waste of industrialization, can harm the environment. Therefore, environmentally friendly methods are encouraged in the industrial environment as energy preservation and climate change mitigation. This research discusses just-in-time single machine scheduling that takes into account energy consumption. In this research, energy consumption depends on the machine’s speed. The objectives are minimizing the just-in-time (JIT) penalty (the sum of weighted earliness/tardiness) and energy consumption. This research proposed a hybrid NSGA-II with a local search to solve the multi-objective scheduling problem. Thus, solving the JIT single-machine scheduling problem considers energy consumption to conserve energy and increase production efficiency. Numerical experiments demonstrated that the hybrid NSGA-II with local search is more effective than the standard NSGA-II in solving the problem. Therefore, decision-makers can use the scheduling model to select alternative solutions that consider energy and the environment without sacrificing efficiency.

scholarly journals Multi-Objective Casting Production Scheduling Problem by a Neighborhood Structure Enhanced Discrete NSGA-II: An Application from Real-World Workshop

2021 ◽  
Author(s):  
Weihua Tan ◽  
Xiaofang Yuan ◽  
Yuhui Yang ◽  
Lianghong Wu
Keyword(s):  
Energy Consumption ◽  
Real World ◽  
Production Scheduling ◽  
Scheduling Problem ◽  
Neighborhood Structure ◽  
Total Energy Consumption ◽  
Nsga Ii ◽  
Research Attention ◽  
Multi Objective ◽  
Casting Production

Abstract Casting production scheduling problem (CPSP) has attracted increasing research attention in recent years to facilitate the profits, efficiency, and environment issues of casting industry. Casting is often characterized by the properties of intensive energy consumption and complex process routes, which motivate the in-depth investigation on construction of practical multi-objective scheduling models and development of effective algorithms. In this paper, for the first time, the multi-objective casting production scheduling problem (MOCPSP) is constructed to simultaneously minimize objectives of defective rate, makespan, and total energy consumption. Moreover, a neighborhood structure enhanced discrete NSGA-II (N-NSGA-II) is designed to better cope with the proposed MOCPSP. In the N-NSGA-II, the advantage of selection mechanism of NSGA-II is fully utilized for selecting non-dominate solution, three neighborhood structures are elaborately designed to strengthen the ability of the local search, and a novel solution generating approach is proposed to increase the diversity of solutions for global search. Finally, a real-world case is illustrated to evaluate the performance of the N-NSGA-II. Computational results show that the proposed N-NSGA-II obtains a wider range of non-dominated solutions with better quality compared to other well-known multi-objective algorithms.

scholarly journals Hybrid Estimation of Distribution Algorithm for Solving Three-Stage Multiobjective Integrated Scheduling Problem

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Chao Deng ◽  
Rong Hu ◽  
Bin Qian ◽  
Huai P. Jin
Keyword(s):  
Energy Consumption ◽  
Local Search ◽  
Manufacturing Industry ◽  
Search Strategies ◽  
Estimation Of Distribution Algorithm ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Hybrid Estimation ◽  
Integrated Scheduling ◽  
Estimation Of Distribution

Aiming at reducing the total energy consumption of three stages processing-transportation-assembly in the assembly manufacturing industry, a three-stage multiobjective integrated scheduling problem with job batch transportation considering the energy consumption (3sMISP_JBTEC) is proposed, and a comprehensive energy consumption model of multistage of 3sMISP_JBTEC with an improved turn off/on strategy in the processing stage and considering speed in the transportation stage is formulated. Then, a hybrid estimation of distribution algorithm with variable neighborhood search (HEDA_VNS) is developed to solve the scheduling problem. In the HEDA_VNS, the reasonable coding/decoding rules and speed scheduling scheme (SSS) are designed. Moreover, two local search strategies are designed to further enhance the performance of HEDA_VNS. Among them, three types of neighborhood search strategies are devised in Local Search I to improve the search efficiency while retaining the structure of the original high-quality solution. A variable neighborhood hybrid operation based on the speed scheduling set is designed in Local Search II to further improve the quality of the solution while balancing the optimization goals. Finally, simulations and comparisons show the efficiency of the proposed HEDA_VNS.

Multi-objective discrete water wave optimization algorithm for solving the energy-saving job shop scheduling problem with variable processing speeds

2021 ◽  
pp. 1-15
Author(s):  
Huiqi Zhu ◽  
Tianhua Jiang ◽  
Yufang Wan ◽  
Guanlong Deng
Keyword(s):  
Energy Saving ◽  
Optimization Algorithm ◽  
Production Scheduling ◽  
Water Wave ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Total Energy Consumption ◽  
Multi Objective ◽  
Variable Processing

For the job shop with variable processing speeds, the aim of energy saving and consumption reduction is implemented from the perspective of production scheduling. By analyzing the characteristics of the workshop, a multi-objective mathematical model is established with the objective of reducing the total energy consumption and shortening the makespan. A multi-objective discrete water wave optimization (MODWWO) algorithm is proposed for solving the problem. Firstly, a two-vector encoding method is adopted to divided the scheduling solution into two parts, which represent speed selection and operation permutation in the scheduling solution, respectively. Secondly, some dispatching rules are used to initialize the population and obtain the initial scheduling solutions. Then, three operators of the basic water wave optimization algorithm are redesigned to make the algorithm adaptive for the multi-objective discrete scheduling problem under study. A new propagation operator is presented with the ability of balancing global exploration and local exploitation based on individual rank and neighborhood structures. A novel refraction operator is designed based on crossover operation, by which each individual can learn from the current best individual to absorb better information. And a breaking operator is modified based on the local search strategy to enhance the exploitation ability. Finally, extensive simulation experiments demonstrate that the proposed MODWWO algorithm is effective for solving the considered energy-saving scheduling problem.

Multi-objective energy-saving scheduling for a permutation flow line

2016 ◽  
Vol 232 (5) ◽  
pp. 879-888 ◽  
Author(s):  
Shunjiang Li ◽  
Fei Liu ◽  
Xiaona Zhou
Keyword(s):  
Energy Consumption ◽  
Energy Saving ◽  
Production Scheduling ◽  
Flow Line ◽  
Numerical Control ◽  
System Level ◽  
Scheduling Problem ◽  
Multi Objective ◽  
Total Flowtime ◽  
Fixed Energy

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.

Optimizing the production scheduling of a single machine to minimize total energy consumption costs

2014 ◽  
Vol 67 ◽  
pp. 197-207 ◽  
Author(s):  
Fadi Shrouf ◽  
Joaquin Ordieres-Meré ◽  
Alvaro García-Sánchez ◽  
Miguel Ortega-Mier
Keyword(s):  
Energy Consumption ◽  
Total Energy ◽  
Single Machine ◽  
Production Scheduling ◽  
Total Energy Consumption
Sign in / Sign up

Export Citation Format

Share Document