multiobjectiveoptimizationofthedistributedpermutationflowshopschedulingproblemwithtransportationandeligibilityconstraints

CSpace > 应用数学研究所

	multiobjectiveoptimizationofthedistributedpermutationflowshopschedulingproblemwithtransportationandeligibilityconstraints
	Cai Shuang; Yang Ke; Liu Ke
	2018
Source Publication	journaloftheoperationsresearchsocietyofchina
ISSN	2194-668X
Volume	6 Issue:3 Pages:391
Abstract	In this paper, we consider the distributed permutation flow shop scheduling problem (DPFSSP) with transportation and eligibility constrains. Three objectives are taken into account, i.e., makespan, maximum lateness and total costs (transportation costs and setup costs). To the best of our knowledge, there is no published work on multi-objective optimization of the DPFSSP with transportation and eligibility constraints. First, we present themathematics model and constructive heuristics for single objective; then, we propose an improved The Nondominated Sorting Genetic Algorithm II (NSGA-II) for the multi-objective DPFSSP to find Pareto optimal solutions, in which a novel solution representation, a new population re-/initialization, effective crossover and mutation operators, as well as local search methods are developed. Based on extensive computational and statistical experiments, the proposed algorithm performs better than the well-known NSGA-II and the Strength Pareto Evolutionary Algorithm 2 (SPEA2).
Language	英语
Document Type	期刊论文
Identifier	http://ir.amss.ac.cn/handle/2S8OKBNM/43037
Collection	应用数学研究所
Affiliation	中国科学院数学与系统科学研究院
Recommended Citation GB/T 7714	Cai Shuang,Yang Ke,Liu Ke. multiobjectiveoptimizationofthedistributedpermutationflowshopschedulingproblemwithtransportationandeligibilityconstraints[J]. journaloftheoperationsresearchsocietyofchina,2018,6(3):391.
APA	Cai Shuang,Yang Ke,&Liu Ke.(2018).multiobjectiveoptimizationofthedistributedpermutationflowshopschedulingproblemwithtransportationandeligibilityconstraints.journaloftheoperationsresearchsocietyofchina,6(3),391.
MLA	Cai Shuang,et al."multiobjectiveoptimizationofthedistributedpermutationflowshopschedulingproblemwithtransportationandeligibilityconstraints".journaloftheoperationsresearchsocietyofchina 6.3(2018):391.

Files in This Item:
There are no files associated with this item.

If you have any objections to this item, please fill out the form below and the administrator will contact you as soon as possible.
Content:
Email：	*
Institution:
Verification Code:	Refresh

Any comments and suggestions are welcomed.
Title:	*
Content:
Email：	*
Verification Code:	Refresh

中国科学院数学与系统科学研究院机构知识库