A multi-population, multi-objective memetic algorithm for energy-efficient job-shop scheduling with deteriorating machines

•Energy-efficient job-shop scheduling with deteriorating machines is studied.•Green production and tardiness related objectives are considered.•A multi-population, multi-objective memetic algorithm is proposed for the problem.•The proposed algorithm exhibits superior performance across a range of me...

Full description

Saved in:
Bibliographic Details
Published in:Expert systems with applications Vol. 157; p. 113348
Main Authors: Abedi, Mehdi, Chiong, Raymond, Noman, Nasimul, Zhang, Rui
Format: Journal Article
Language:English
Published: New York Elsevier Ltd 01.11.2020
Elsevier BV
Subjects:
Algorithms
Cumulative deterioration effect
Deterioration
Energy consumption
Energy efficiency
Job shop scheduling
Job shops
Machine speed scaling
Maintenance
Maintenance activity
Memetic algorithm
Optimization
Performance measurement
Periodic local search
Schedules
Scheduling
Searching
Sequences
Solution space
Cumulative deterioration effect
Periodic local search
Maintenance activity
Memetic algorithm
Machine speed scaling
Job-shop scheduling
ISSN:0957-4174, 1873-6793
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•Energy-efficient job-shop scheduling with deteriorating machines is studied.•Green production and tardiness related objectives are considered.•A multi-population, multi-objective memetic algorithm is proposed for the problem.•The proposed algorithm exhibits superior performance across a range of metrics. This paper focuses on an energy-efficient job-shop scheduling problem within a machine speed scaling framework, where productivity is affected by deterioration. To alleviate the deterioration effect, necessary maintenance activities must be put in place during the scheduling process. In addition to sequencing operations on machines, the problem at hand aims to determine the appropriate speeds of machines and positions of maintenance activities for the schedule, in order to minimise the total weighted tardiness and total energy consumption simultaneously. To deal with this problem, a multi-population, multi-objective memetic algorithm is proposed, in which the solutions are distributed into sub-populations. Besides a general local search, an advanced objective-oriented local search is also executed periodically on a portion of the population. These local search methods are designed based on a new disjunctive graph introduced to cover the solution space. Furthermore, an efficient non-dominated sorting method for bi-objective optimisation is developed. The performance of the memetic algorithm is evaluated via a series of comprehensive computational experiments, comparing it with state-of-the-art algorithms presented for job-shop scheduling problems with/without considering energy efficiency. Experimental results confirm that the proposed algorithm can outperform other algorithms being compared across a range of performance metrics.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2020.113348