A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem
The job shop scheduling problem (JSSP) is a notoriously difficult problem in combinatorial optimization. In terms of the objective function, most existing research has been focused on the makespan criterion. However, in contemporary manufacturing systems, due-date-related performances are more impor...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2011-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2011/390593 |
id |
doaj-df88d23a3ea3476498deb8e00e1a42b7 |
---|---|
record_format |
Article |
spelling |
doaj-df88d23a3ea3476498deb8e00e1a42b72020-11-24T22:19:21ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472011-01-01201110.1155/2011/390593390593A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling ProblemRui Zhang0Cheng Wu1School of Economics and Management, Nanchang University, Nanchang 330031, ChinaDepartment of Automation, Tsinghua University, Beijing 100084, ChinaThe job shop scheduling problem (JSSP) is a notoriously difficult problem in combinatorial optimization. In terms of the objective function, most existing research has been focused on the makespan criterion. However, in contemporary manufacturing systems, due-date-related performances are more important because they are essential for maintaining a high service reputation. Therefore, in this study we aim at minimizing the total weighted tardiness in JSSP. Considering the high complexity, a hybrid differential evolution (DE) algorithm is proposed for the problem. To enhance the overall search efficiency, a neighborhood property of the problem is discovered, and then a tree search procedure is designed and embedded into the DE framework. According to the extensive computational experiments, the proposed approach is efficient in solving the job shop scheduling problem with total weighted tardiness objective.http://dx.doi.org/10.1155/2011/390593 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Rui Zhang Cheng Wu |
spellingShingle |
Rui Zhang Cheng Wu A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem Mathematical Problems in Engineering |
author_facet |
Rui Zhang Cheng Wu |
author_sort |
Rui Zhang |
title |
A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem |
title_short |
A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem |
title_full |
A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem |
title_fullStr |
A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem |
title_full_unstemmed |
A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem |
title_sort |
hybrid differential evolution and tree search algorithm for the job shop scheduling problem |
publisher |
Hindawi Limited |
series |
Mathematical Problems in Engineering |
issn |
1024-123X 1563-5147 |
publishDate |
2011-01-01 |
description |
The job shop scheduling problem (JSSP) is a notoriously difficult problem in combinatorial optimization. In terms of the objective function, most existing research has been focused on the makespan criterion. However, in contemporary manufacturing systems, due-date-related performances are more important because they are essential for maintaining a high service reputation. Therefore, in this study we aim at minimizing the total weighted tardiness in JSSP. Considering the high complexity, a hybrid differential evolution (DE) algorithm is proposed for the problem. To enhance the overall search efficiency, a neighborhood property of the problem is discovered, and then a tree search procedure is designed and embedded into the DE framework. According to the extensive computational experiments, the proposed approach is efficient in solving the job shop scheduling problem with total weighted tardiness objective. |
url |
http://dx.doi.org/10.1155/2011/390593 |
work_keys_str_mv |
AT ruizhang ahybriddifferentialevolutionandtreesearchalgorithmforthejobshopschedulingproblem AT chengwu ahybriddifferentialevolutionandtreesearchalgorithmforthejobshopschedulingproblem AT ruizhang hybriddifferentialevolutionandtreesearchalgorithmforthejobshopschedulingproblem AT chengwu hybriddifferentialevolutionandtreesearchalgorithmforthejobshopschedulingproblem |
_version_ |
1725779597472038912 |