Energy-Conscious Common Operation Scheduling in an Identical Parallel Machine Environment

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Ataei H.; Ahmadizar F.; Arkat J.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: International Journal of Engineering Year:2024 | Volume:37 | Issue:7 Page(s): 1443-1465

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Energy-Conscious Common Operation Scheduling in an Identical Parallel Machine Environment

Author(s)

Ataei H. | Ahmadizar F. | Arkat J. | Issue Writer Certificate

Keywords

Bi-objective mixed integer linear programming

Identical Parallel Machine Scheduling Common Operation

Total energy consumption

Total completion time

Abstract

The relentless growth of global energy consumption poses a multitude of complex challenges, including the depletion of finite energy resources and the exacerbation of greenhouse gas emissions, which contribute to climate change. In the face of these pressing environmental concerns, the manufacturing sector, a significant energy consumer, is under immense pressure to adopt sustainable practices. The critical intersection of energy consumption management and production operation scheduling emerges as a pivotal domain for addressing these challenges. The scheduling of common operations, exemplified by the cutting stock problem in industries like furniture and apparel, represents a prevalent challenge in production environments. For the first time, this paper pioneers an investigation into an identical parallel machine scheduling problem, taking into account common operations to minimize Total energy consumption and Total completion time concurrently. For this purpose, two Bi-objective mixed integer linear programming models are presented, and an augmented ε – constraint method is used to obtain the Pareto optimal front for small-scale instances. Considering the NP-hardness of this problem, a non-dominated sorting genetic algorithm (NSGA-II) and a hybrid non-dominated sorting genetic algorithm with particle swarm optimization (HNSGAII-PSO) are developed to solve medium- and large-scale instances to achieve good approximate Pareto fronts. The performance of the proposed algorithms is assessed by conducting computational experiments on test problems. The results demonstrate that the proposed HNSGAII-PSO performs better than the suggested NSGA-II in solving the test problems.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans