Paper Info
Title
A Discrete Differential Evolution Algorithm for Lot-streaming Flow Shop Scheduling Problem
Abstract
A discrete differential evolution(DDE) algorithm is developed for solving the lot - streaming flow shop scheduling problem(LFSP) with the objective of minimizing the total weighted earliness and tardiness.Unlike the traditional differential evolution(DE) algorithm,the proposed DDE algorithm applies the job - permutation - based representation, and employs the job - permutation - based mutation and crossover operators.Therefore,the DDE algorithm can be easy used for solving the lot - streaming flow shop scheduling problem.In addition,an adaptive neighborhoods local search is presented and embedded into the DDE algorithm to enhance its local searching ability.Computational results show that the DDE algorithm presented in this paper produces slightly better results than the DPSO of Chao - Tang Tseng et al.
Year
DOI
Venue
2010
10.1109/ICNC.2010.5583339
ICNC
Keywords
Field
DocType
flow shop scheduling,discrete differential evolution algorithm,earliness penalties,global exploitation,insert neighborhood structure,job permutations based representation,local search procedure,lot-streaming flow shop scheduling problems,swap neighborhood structure,total weighted tardiness,differential evolution,lot-streaming flow shop scheduling,metaheuristics,total weighted earliness and tardiness penalties
Mathematical optimization,Tardiness,Job shop scheduling,Fair-share scheduling,Computer science,Flow shop scheduling,Algorithm,Two-level scheduling,Rate-monotonic scheduling,Local search (optimization),Dynamic priority scheduling
Conference
Volume
Issue
Citations 
1
07
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Hong-yan Sang116511.18