A green scheduling algorithm for flexible job shop with energy-saving measures

We study how to save energy from the viewpoint of operation management. When to turn-on/off machines and which speed level to choose are two measures we employ to save energy. We focus on the flexible job shop scheduling problem. To begin with, a model is formulated for the flexible job shop schedul...

Full description

Saved in:
Bibliographic Details
Published in:Journal of cleaner production Vol. 172; pp. 3249 - 3264
Main Authors: Wu, Xiuli, Sun, Yangjun
Format: Journal Article
Language:English
Published: Elsevier Ltd 20.01.2018
Subjects:
ISSN:0959-6526, 1879-1786
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study how to save energy from the viewpoint of operation management. When to turn-on/off machines and which speed level to choose are two measures we employ to save energy. We focus on the flexible job shop scheduling problem. To begin with, a model is formulated for the flexible job shop scheduling problem when the two energy-saving measures are under consideration. An energy consumption model is proposed to compute the energy consumption for a machine in different states. Then, a non-dominated sorted genetic algorithm is developed to solve the problem. In the non-dominated sorted genetic algorithm, a green scheduling heuristic is presented to optimize the makespan, the energy consumption and the numbers of turning-on/off machines simultaneously. Finally, the comprehensive experiment results prove that the proposed model and the algorithm can solve the problem effectively and efficiently.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0959-6526
1879-1786
DOI:10.1016/j.jclepro.2017.10.342