Keywords = Energy consumption

A flow shop scheduling model considering no-wait constraints between sequential tasks

Volume 13, Issue 1, July 2026, Pages 86-96

https://doi.org/10.22116/jiems.2026.555292.1620

Fatemeh Zahmatkesh, Maryam Daneshmand-Mehr, Milad Abolghasemian

Abstract Flow shop scheduling has traditionally focused on minimizing completion time; however, growing energy costs and sustainability concerns necessitate the simultaneous consideration of energy consumption as an optimization objective. In addition, in many real-world manufacturing systems, such as chemical, food, and continuous production industries, jobs must be processed without waiting between successive operations, a constraint that significantly increases problem complexity. Despite its practical relevance, the combined consideration of no-wait flow shop scheduling and energy-aware optimization has received limited attention in the literature. This study develops a bi-objective no-wait flow shop scheduling model that simultaneously minimizes makespan and total energy consumption, accounting for both active and idle energy usage of machines. A mathematical formulation is proposed, and due to the NP-hard nature of the problem, the NSGA II metaheuristic algorithm is employed to obtain high-quality Pareto-optimal solutions. Model validity is verified using small-scale instances solved optimally, followed by large-scale computational experiments. Furthermore, a comprehensive parametric sensitivity analysis is conducted to examine the influence of key factors, including processing time, number of tasks, and machine energy consumption in active and idle states, on both objectives. The results reveal that idle energy consumption has a disproportionately high impact on total energy usage and completion time, underscoring its critical role in sustainable scheduling decisions. The findings provide both theoretical insights and practical guidelines for designing energy-efficient schedules in no-wait production environments.

Scheduling Operations with Heterogeneous Parallel Machines to Minimize Energy Consumption and Total Tardiness Using the Multi-Objective Evolutionary Algorithm

Volume 11, Issue 2, December 2024, Pages 85-96

https://doi.org/10.22116/jiems.2025.494951.1583

Shahram Saeidi

Abstract In recent years, the significant increase in energy consumption and global warming have raised international concerns. Given the interconnectedness of economics, energy, and environmental concerns, energy consumption is critical in planning various systems. Optimizing production operations in various industries is a significant and complex challenge. Given the increasing global market competition and the importance of cost reduction, production process optimization has become increasingly important. One critical issue in this area is job scheduling in production systems with parallel machines. These systems' machine performance and energy consumption differences can significantly impact operating costs and job delivery times. These differences lead to machine heterogeneity, which is observed in many modern industries. Considering the challenges in managing energy consumption and the negative impacts of delays in product delivery, optimizing production processes to increase system efficiency and reduce energy consumption has become increasingly important. This research investigated the job scheduling problem in production systems with a heterogeneous parallel machine environment to minimize energy consumption and total job tardiness. In this research, a two-objective mathematical model for job scheduling was first designed, and a multi-objective meta-heuristic algorithm based on decomposition was used to solve this model. It was simulated in MATLAB software on several small, medium, and large sample examples. Comparing the results of the proposed method with those of previous methods shows the efficiency and superiority of the proposed method.

A bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption

Volume 6, Issue 2, December 2019, Pages 44-64

https://doi.org/10.22116/jiems.2019.92256

Seyed Mohammad Hassan Hosseini

Abstract The two-stage assembly flowshop scheduling problem has been studied in this research. Suppose that a number of products of different kinds are needed to be produced. Each product is consists of several parts. There are m uniform machines in the first stage to manufacture the components (parts) of products and there is one assembly station in the second stage to assembled parts into products. Setup operation should be done when a machine starts processing a new part and setup times are treated as separate from processing times. Two objective functions are considered: (1) minimizing the completion time of all products (makespan) as a classic objective, and (2) minimizing the cost of energy consumption as a new objective. Processing speed of each machine is adjustable and the rate of energy consumption of each machine is dependent of its processing speed. At first, this problem is described with an example, and then needed parameters and decision variables are defined. After that, this problem is modeled as a mixed integer linear programming (MILP) and GAMS software is applied to solve small problems. To solve this bi-objective model, Epsilon Constraint algorithm is used on some test problems obtained standard references. Data of test problems were obtained from previous references and new parameters have been adjusted for considered problem. Conflicting of two considered objective functions has been valid through the result. In additional, result of solving test problems and sensitivity analysis show that how we can reduce energy consumption by adjusting completion times.