A differential evolution approach for NTJ-NFSSP with SDSTs and RDs

Authors:
Rong Hu;Xianghu Meng;Bin Qian;Kun Li
Affiliations:
Department of Automation, Kunming University of Science and Technology, Kunming, China;Department of Automation, Kunming University of Science and Technology, Kunming, China;Department of Automation, Kunming University of Science and Technology, Kunming, China;Department of Automation, Kunming University of Science and Technology, Kunming, China
Venue:
ICIC'12 Proceedings of the 8th international conference on Intelligent Computing Theories and Applications
Year:
2012

Citing 6
Cited 0

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
A differential evolution approach for the common due date early/tardy job scheduling problem

Computers and Operations Research
A discrete differential evolution algorithm for the permutation flowshop scheduling problem

Computers and Industrial Engineering
A simulated annealing algorithm for single machine scheduling problems with family setups

Computers and Operations Research
A DE-based approach to no-wait flow-shop scheduling

Computers and Industrial Engineering
Hybrid differential evolution optimization for no-wait flow-shop scheduling with sequence-dependent setup times and release dates

ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an efficient differential evolution approach, namely DE_NTJ, is presented to minimize the number of tardy jobs (NTJ) for the no-wait flow-shop scheduling problem (NFSSP) with sequence-dependent setup times (SDSTs) and release dates (RDs), which is a complex problem and can be abbreviated as NTJ-NFSSP with SDSTs and RDs. To balance the exploration and exploitation abilities of our DE_NTJ, DE-based global search is utilized to obtain the promising regions or solutions over the solution space, and a local search based on the interchange-based neighborhood and problem's properties is developed to exploit the neighborhoods from these regions. Simulation results based on a set of random instances show the superiority of DE_NTJ in terms of searching quality, efficiency, and robustness.