Multi-objective Optimization of the Distributed Permutation Flow Shop Scheduling Problem with Transportation and Eligibility Constraints

被引：32

作者：

Cai S. ^{[1
,2
]}

Yang K. ^{[1
,2
]}

Liu K. ^{[1
,2
,3
,4
]}

机构：

[1] Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing

[2] University of Chinese Academy of Sciences, Beijing

[3] Key Laboratory of Management, Decision and Information Systems, Chinese Academy of Sciences, Beijing

[4] National Center for Mathematics and Interdisciplinary Sciences, Chinese Academy of Sciences, Beijing

来源：

Journal of the Operations Research Society of China | 2018年 / 6卷 / 03期

基金：

中国国家自然科学基金;

关键词：

Distributed scheduling; Multi-objective optimization; NSGA-II; Permutation flow shop scheduling; Transportation;

D O I：

10.1007/s40305-017-0165-3

中图分类号：

学科分类号：

摘要：

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 the mathematics 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). © 2017, Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag Berlin Heidelberg.

引用

页码：391 / 416

页数：25

共 58 条

[21]

Lin S.W., Ying K.C., Huang C.Y., Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm, Int. J. Prod. Res., 51, 16, pp. 5029-5038, (2013)

[22]

Wang S.Y., Wang L., Liu M., Xu Y., An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem, Int. J. Prod. Econ., 145, 1, pp. 387-396, (2013)

[23]

Xu Y., Wang L., Wang S., Liu M., An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem, Eng. Optim., 46, 9, pp. 1269-1283, (2014)

[24]

Naderi B., Ruiz R., A scatter search algorithm for the distributed permutation flowshop scheduling problem, Eur. J. Oper. Res., 239, 2, pp. 323-334, (2014)

[25]

Wang J., Wang L., Shen J., A hybrid discrete cuckoo search for distributed permutation flowshop scheduling problem, 2016 IEEE Congress on Evolutionary Computation, pp. 2240-2246, (2016)

[26]

Wang K., Huang Y., Qin H., A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown, J. Oper. Res. Soc., 67, 1, pp. 68-82, (2016)

[27]

Pareto V., Oeuvres Complètes: Tome 7, Manuel d’économie Politique, (1981)

[28]

Ciavotta M., Minella G., Ruiz R., Multi-objective sequence dependent setup times permutation flowshop: a new algorithm and a comprehensive study, Eur. J. Oper. Res., 227, 2, pp. 301-313, (2013)

[29]

Ishibuchi H., Murata T., A multi-objective genetic local search algorithm and its application to flowshop scheduling, IEEE Trans. Syst. Man Cybern. Part C (Appl. Rev.), 28, 3, pp. 392-403, (1998)

[30]

Varadharajan T.K., Rajendran C., A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, Eur. J. Oper. Res., 167, 3, pp. 772-795, (2005)

← 1 2 3 4 5 6 →